A BRANCH-AND-BOUND ALGORITHM FOR THE OPEN-SHOP PROBLEM

Authors
BRUCKER P HURINK J JURISCH B WOSTMANN B
Citation
P. Brucker et al., A BRANCH-AND-BOUND ALGORITHM FOR THE OPEN-SHOP PROBLEM, Discrete applied mathematics, 76(1-3), 1997, pp. 43-59
Citations number
16
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
76
Issue
1-3
Year of publication
1997
Pages
43 - 59
Database
ISI
SICI code
Abstract
A fast branch & bound method for the open-shop problem based on a disj unctive graph formulation of the problem is developed. Computational r esults show that the method yields excellent results. Some benchmark p roblems from the literature were solved to optimality for the first ti me.