Complexity of the job insertion problem in multi-stage scheduling

  • Authors:

  • Arjen P. A. Vestjens;Marc Wennink;Gerhard J. Woeginger

  • Affiliations:

  • Centre for Quantitative Methods CQM BV, Postbus 414, 5600 AK Eindhoven, The Netherlands;BT Research, Sirius House 140, Adastral Park, Martlesham Heath, Suffolk IP5 3RE, UK;Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Operations Research Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.