Abstract
We show that obtaining minimum finish time schedules with no wait in process is NP-Hard for flow shops, job shops and open shops. Specifically, it is shown that the two processor job and open shop problems are NP-Hard even when jobs are restricted to have no task of length zero. The two processor flow shop problem is NP-Hard if jobs with only one task are permitted. Note that Gilmore and Gomory (Gilmore, P., R. Gomory. 1964. Sequencing a one state-variable machine: A solvable case of the travelling salesman problem. Oper. Res. 12 655–679.) have obtained a polynomial time algorithm for the two processor flow shop for the case where every job has two tasks. The 4-sum and 2-pair problems are also shown NP-Hard.
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.
