Journal Article10.1287/IJOC.3.2.149
A Computational Study of the Job-Shop Scheduling Problem
David Applegate,William J. Cook +1 more
894
TL;DR: The optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10×10 problem of J. F. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1.
read more
Abstract: The job-shop scheduling problem is a notoriously difficult problem in combinatorial optimization. Although even modest sized instances remain computationally intractable, a number of important algorithmic advances have been made in recent years by J. Adams, E. Balas and D. Zawack; J. Carlier and E. Pinson; B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan; and others. Making use of a number of these advances, we have designed and implemented a new heuristic procedure for finding schedules, a cutting-plane method for obtaining lower bounds, and a combinatorial branch and bound algorithm. Our optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10×10 problem of J. F. Muth and G. L. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Applying tabu search to the job-shop scheduling problem
Mauro Dell'Amico,Marco Trubian +1 more
TL;DR: This paper applies the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization and shows that the implementation of this method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements.
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling
Carla Juvin,Emmanuel Hebrard,Laurent Houssin,Pierre Lopez +3 more
TL;DR: It is observed that a large class of preemptive disjunctive scheduling problems do not require an explicit model of task interruptions, and a new constraint programming approach is introduced that significantly outperforms state-of-the-art dedicated approaches.
A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
Marcos Singer,Michael Pinedo +1 more
TL;DR: In this paper, the authors present and compare a number of branch and bound algorithms for minimizing the total weighted tardiness in job shops, and obtain optimal solutions for all the instances with ten jobs and ten machines that they consider, including three tardy versions of a well-known 10 × 10 instance introduced by Muth and Thompson [1] in 1963.
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
Michael Pinedo,Marcos Singer +1 more
TL;DR: A shifting bottleneck heuristic for minimizing the total weighted tardi- ness in a job shop that clearly outperforms a well-known dispatching rule enhanced with backtracking mechanisms.
Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
G. I. Zobolas,Christos D. Tarantilis,George Ioannou +2 more
- 01 Jan 2008
TL;DR: This chapter sets out to present a very important class of production scheduling problems and the main methods employed to solve them, followed by an analysis of their computational complexity.