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
Polyhedral Approaches to Machine Scheduling
Maurice Queyranne,Andreas S. Schulz +1 more
- 01 Jan 2008
TL;DR: The important role that supermodular polyhedra and greedy algorithms play in many formulations and the strength of the lower and upper bounds obtained from different formulations and relaxations are analyzed.
Synthesis of efficient constraint-satisfaction programs
TL;DR: This paper describes the framework developed in KIDS (Kestrel Interactive Development System) and shows how constraints from the original problem can be automatically reformulated and specialised in order to derive efficient propagation code automatically.
A unified framework for partial and hybrid search methods in constraint programming
Simon de Givry,Laurent Jeannin +1 more
TL;DR: A library for the design of complex tree search algorithms in constraint programming (CP), which allows the expression of most of the partial, i.e. nonsystematic backtracking, search methods, and also a specific class of hybrid local/global search methods called large neighborhood search, which are very naturally suited to CP.
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes
Janniele A. S. Araujo,Haroldo Gambini Santos,Haroldo Gambini Santos,Bernard Gendron,Sanjay Dominik Jena,Samuel Souza Brito,Danilo S. Souza +6 more
TL;DR: A cutting plane algorithm to separate five different cut families, as well as a new preprocessing routine to strengthen resource-related constraints, allowing a state-of-the-art mixed-integer linear programming solver to find provably optimal solutions for 754 previously open instances of different variants of the RCPSPs.
•Proceedings Article
Improved local search for job shop scheduling with uncertain durations
Inés González-Rodríguez,Camino R. Vela,Jorge Puente,Alejandro Hernández-Arauzo +3 more
- 19 Sep 2009
TL;DR: Theoretical results show that the proposed neighbourhood contains all the improving solutions from the original neighbourhood and provide a sufficient condition for optimality, and a makespan lower bound is proposed which can be used to discard neighbours.