Note. Satisfying Due Dates in Large Job Shops

Note. Satisfying Due Dates in Large Job Shops

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, L max . Computational exp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science 1998-10, Vol.44 (10), p.1442-1446
Hauptverfasser: Hodgson, Thom J, Cormier, Denis, Weintraub, Alexander J, Zozom, Andrew
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Exact sciences and technology
Information technology
Job Shop Scheduling
Job shops
Management
Mathematical models
Maximum Lateness
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling, sequencing
Simulation
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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, L max . Computational experimentation is used to identify the conditions under which the approach is most viable.
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.44.10.1442