Abstract
We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We develop several lower bounds and we describe constructive heuristics as well as an effective genetic local search algorithm. Computational experiments carried out on a large set of randomly generated instances provide evidence that a constructive heuristic based on new derived priority rule as well as the genetic algorithm perform consistently well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
