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 bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach
TL;DR: A bi-objective branch-and-bound and an ∊ -constraint algorithms are proposed for the unit-time job shop scheduling problem and are found to find an optimal set of non-dominated solutions for most of the tested benchmarks within a reasonable amount of CPU time.
7
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem
TL;DR: In this article , the use of a guidance operator responsible for modifying ill-adapted individuals using genetic material from well-adapting individuals was proposed to circumvent the problems of premature convergence and population concentration in regions of local optima.
A Job-Shop Scheduling Problem with Fuzzy Processing Times
Feng-Tse Lin
- 28 May 2001
TL;DR: This work intends to extend the deterministic job-shop scheduling problem into a more generalized problem that would be useful in practical situations.
•Journal Article
A Giffler-Thompson focused genetic algorithm for the static job shop scheduling problem
Mark Moonen,Gerrit Janssens +1 more
TL;DR: The genetic algorithm, as presented here, makes use of a parameter, which is believed to have an important influence on performance of the algorithm and of which an intelligent setting of its value might lead to promising results for the most difficult job-shop scheduling problems.
6
Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems
Pedro M. Castro,Ignacio E. Grossmann,Louis-Martin Rousseau +2 more
- 01 Jan 2011
TL;DR: This chapter provides a review of decomposition algorithms for models that are formulated as hybrid mixed-integer linear/constraint programming problems, such as logic Bender Decomposition and Constraint Programming-Based Column Generation.
6