A Branch and Bound Method for the Open Shop Problem

P. Brucker, Johann L. Hurink, B. Jurisch, B. Wöstmann

Research output: Contribution to journalArticleAcademicpeer-review

131 Citations (Scopus)
693 Downloads (Pure)


A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.
Original languageEnglish
Pages (from-to)43-59
Number of pages17
JournalDiscrete applied mathematics
Issue number1-3
Publication statusPublished - 13 Jun 1997


Dive into the research topics of 'A Branch and Bound Method for the Open Shop Problem'. Together they form a unique fingerprint.

Cite this