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
Ageing workforce effects in Dual-Resource Constrained job-shop scheduling
TL;DR: This paper shows how fatigue can be incorporated into operational processes such as scheduling in the context of a Dual-Resource Constrained (DRC) job shop and considers several models to integrate rest allowance into the scheduling process and presents a heuristic approach to assign operations to workers and machines.
57
A filter-and-fan approach to the job shop scheduling problem
César Rego,Renato Duarte +1 more
TL;DR: A new heuristic algorithm is proposed that effectively combines the classical shifting bottleneck procedure (SBP) with a dynamic and adaptive neighborhood search procedure, based on a filter-and-fan (F&F) procedure.
57
A linearized polynomial mixed integer programming model for the integration of process planning and scheduling
Wei Tan,Behrokh Khoshnevis +1 more
TL;DR: This paper presents a linearized polynomial mixed-integer programming model (PMIPM) for the integration of process planning and scheduling problem, and provides a fundamental framework for further research in this area.
57
Dynamic Jobshop Scheduling Algorithm Based on Deep Q Network
TL;DR: In this paper, a Deep Q Network (DQN) based adaptive jobshop scheduling algorithm is proposed to make decisions on the complex dynamic scheduling process more accurately and simplify the solution process.
No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems
TL;DR: A fast tabu search algorithm is implemented for the no-wait job shop problem with a makespan objective and is extensively tested on known benchmark instances and compares favorably to the best existing algorithms.
54