A Branch and Bound Algorithm for the Job-Shop Scheduling Problem

@article{Brucker1994ABA,
  title={A Branch and Bound Algorithm for the Job-Shop Scheduling Problem},
  author={Peter Brucker and Bernd Jurisch and Bernd Sievers},
  journal={Discrete Applied Mathematics},
  year={1994},
  volume={49},
  pages={107-127}
}
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 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results. 
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 283 citations. REVIEW CITATIONS
162 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 162 extracted citations

283 Citations

01020'93'98'04'10'16
Citations per Year
Semantic Scholar estimates that this publication has 283 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A computational study of job shop scheduling, CMU-CS-90-145

  • D. Applegate, W. Cook
  • ORSA J. Comput
  • 1991
Highly Influential
7 Excerpts

Job-shop scheduling: A comparison of three enumeration schemes in a branch and bound approach, Master’s thesis, Erasmus University Roterdam

  • R. W. Bouma
  • Faculty of Econometrics and Operations Research
  • 1982
Highly Influential
8 Excerpts

A new lower bound for the job-shop scheduling problem

  • P. Brucker, B. Jurisch
  • European J. Oper. Res
  • 1993

A practical use of Jackson’s preemptive schedule for solving the job shop problem, Ann

  • J. Carlier, E. Pinson
  • Oper. Res
  • 1990

Algorytm blokowy szeregowania operacji w systemie gniazdowyn

  • E. Nowicki Grabowski, C. Smutnicki
  • Ann . Oper . Res .
  • 1990

An algorithm for solving the job-shop problem

  • J. Carlier, E. Pinson
  • Management Sci
  • 1989

The shifting bottleneck procedure for job - shop scheduling

  • D. Zawack
  • Management Sci .
  • 1988

Zdrzalka, A block approach for single machine scheduling with relase dates and due dates

  • J. Grabowski, S. E. Nowicki
  • European J. Oper. Res
  • 1986

Complexity of machine scheduling problems, in: Annals of Discrete Mathematics 1 (North-Holland

  • J. K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker
  • 1977

Similar Papers

Loading similar papers…