Note. Satisfying Due Dates in Large Job Shops

Authors:
Thom J. Hodgson;Denis Cormier;Alexander J. Weintraub;Andrew Zozom, Jr.
Affiliations:
-;-;-;-
Venue:
Management Science
Year:
1998

Citing 0
Cited 5

Scheduling & control: rolling horizon scheduling in large job shops

Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Supply chain planning: rolling horizon scheduling of multi-factory supply chains

Proceedings of the 35th conference on Winter simulation: driving innovation
Factory scheduling: implementing a simulation-based scheduling system for a two-plant operation

Proceedings of the 35th conference on Winter simulation: driving innovation
The deployment scheduling analysis tool (DSAT)

Mathematical and Computer Modelling: An International Journal
An effective lower bound on Lmax in a worker-constrained job shop

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

For the multi-machine job shop scheduling problem, a conceptually simple simulation-based procedure (first proposed by Lawrence and Morton 1986) is shown to be both effective and efficient in providing optimal, or near optimal, schedules for minimizing the maximum lateness, Lmax. Computational experimentation is used to identify the conditions under which the approach is most viable.