The two-machine open shop problem: To fit or not to fit,

Marjan van den Akker, Han Hoogeveen, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)


We consider the open shop scheduling problem with two machines. Each job consists of two operations, and it is prescribed that the first (second) operation has to be executed by the first (second) machine. The order in which the two operations are scheduled is not fixed, but their execution intervals cannot overlap. We are interested in the question whether, for two given values D1 and D2, there exists a feasible schedule such that the first and second machine process all jobs during the intervals [0,D1] and [0,D2], respectively. We formulate four simple conditions on D1 and D2, which can be verified in linear time. These conditions are necessary and sufficient for the existence of a feasible schedule. The proof of sufficiency is algorithmical, and yields a feasible schedule in linear time. Furthermore, we show that there are at most two non-dominated points (D1,D2) for which there exists a feasible schedule.
Original languageEnglish
Pages (from-to)219-224
Number of pages6
JournalOperations research letters
Issue number3
Publication statusPublished - 2003


  • Scheduling
  • Sequencing
  • Open shop scheduling
  • Bicriterion optimization
  • IR-75023
  • METIS-213204
  • Flow shop scheduling


Dive into the research topics of 'The two-machine open shop problem: To fit or not to fit,'. Together they form a unique fingerprint.

Cite this