A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM

Authors
BRUCKER P JURISCH B SIEVERS B
Citation
P. Brucker et al., A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM, Discrete applied mathematics, 49(1-3), 1994, pp. 107-127
Citations number
17
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
49
Issue
1-3
Year of publication
1994
Pages
107 - 127
Database
ISI
SICI code
Abstract
A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 x 10 be nchmark problem which has been open for more than 20 years. We will gi ve a complete description of this algorithm and will present computati onal results.