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 experimentation is used to identify the conditions under which the approach is most viable.

• 저널Management Science · 44(10) · 1442–1446
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.44.10.1442
• 저자Thom J. Hodgson, Denis Cormier, Alexander J. Weintraub, Andrew Zozom