A Computational Study of the Job-Shop Scheduling Problem
ORSA Journal on Computing · 1991-05 · 3 (2) · 149-156
DOI: 10.1287/ijoc.3.2.149 ↗Kurz gefasst
Fachartikel in der Zeitschrift ORSA Journal on Computing, 1991-05. Verfasst von David Applegate und 1 weiteren Autor:innen. Die Arbeit wurde bisher 674-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Applegate, D., & Cook, W. (1991). A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3(2), 149-156. https://doi.org/10.1287/ijoc.3.2.149
Vancouver
Applegate D, Cook W. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing. 1991;3(2):149-156. doi:10.1287/ijoc.3.2.149
BibTeX
@article{Applegate1991,
author = {Applegate, David and Cook, William},
title = {A Computational Study of the Job-Shop Scheduling Problem},
journal = {ORSA Journal on Computing},
year = {1991},
volume = {3},
number = {2},
pages = {149--156},
doi = {10.1287/ijoc.3.2.149}
}
EUVIMED