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
A GES/TS algorithm for the job shop scheduling
TL;DR: This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem and confirms the effectiveness of the algorithm and its high speed.
32
A decomposition heuristic for scheduling the general batch chemical plant
TL;DR: A heuristic decomposition algorithm for scheduling the generalized batch chemical plant is presented and the quality of the solutions obtained has been experimentally tested on a number of case studies of various complexity.
31
A guided tabu search/path relinking algorithm for the job shop problem
TL;DR: In this paper, a tabu search-based algorithm is proposed for the job shop scheduling problem with makespan criterion, which takes advantage of both N1 and N6 neighborhoods and is tested on standard benchmark sets, outperformed all previous approaches (including i-TSAB) and found six new upper bounds.
31
Industrial-size job shop scheduling with constraint programming
TL;DR: In this article , the authors compare the performance of OR-Tools and CP Optimizer, two state-of-the-art constraint solvers with respect to industrial-size job shop scheduling problem instances.
31
•Dissertation
Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling
Mark S. Fox,John Christopher Beck +1 more
- 01 Jan 1999
TL;DR: This dissertation develops the concept of a generalized measure of constraint criticality that enables the construction of dynamic, opportunistic heuristic commitment techniques and suggests the probability of breakage of a constraint as such a measure.