| Article ID: | iaor20083765 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 6 |
| Start Page Number: | 754 |
| End Page Number: | 758 |
| Publication Date: | Nov 2007 |
| Journal: | Operations Research Letters |
| Authors: | Woeginger Gerhard J., Wennink Marc, Vestjens Arjen P.A. |
The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additional job, find a feasible insertion of the additional job into the schedule that minimizes the resulting makespan. We prove that finding the optimal job insertion is NP-hard for flow shops and open shops.