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
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Yunpeng Pan,Leyuan Shi +1 more
TL;DR: Three improved branch-and-bound algorithms based on CA are presented and a new lower bound and a problem size reduction technique are developed to substantially outperform CA in terms of CPU time and robustness.
16
A new hybrid heuristic technique for solving job-shop scheduling problem
Cheng-Fa Tsai,Feng-Cheng Lin +1 more
TL;DR: Simulation results demonstrate that the proposed novel JSP method, called the PLGA algorithm, is very efficient and potentially useful in solving job-shop scheduling problems.
A Modeling Framework for Project Staffing and Scheduling Problems
Isabel Correia,Francisco Saldanha-da-Gama +1 more
- 01 Jan 2015
TL;DR: This chapter addresses modeling issues associated with project staffing and scheduling problems andphasis is given to mixed-integer linear programming formulations.
16
Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
TL;DR: SPSS is used to prove that the proposed auction-based approach to address the flexible job-shop scheduling problem with multiple process plans exhibits an absolute advantage, particularly for medium-scale or large-scale instances.
16
•Posted Content
A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems
S. Narendhar,T. Amudha +1 more
TL;DR: In this article, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Fungus Optimization for solving job shop scheduling problem was proposed.
16