Abstract
In studying the m-machine flow shop scheduling problem, it is common practice to focus attention on permutation schedules. We show that for the problem of minimizing the maximum completion time, this assumption can be a costly one, by exhibiting a family of instances for which the value of the best permutation schedule is worse than that of the true optimal schedule by a factor of more than 1 2 √m .
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.
