Abstract
We present two simple heuristic algorithms for scheduling to minimize makespan in the constrained (or no-wait) flowshop. While developing the heuristics, we first present the methods to obtain the initial seed sequences, and subsequently obtain better solutions by an improvement technique. When evaluated over a large number of problems of various sizes, the solutions yielded by the proposed heuristic algorithms are found to be reasonably accurate, and superior to the ones given by the existing heuristics.
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.
