Note. Satisfying Due Dates in Large Job Shops
Published Online:1 Oct 1998https://doi.org/10.1287/mnsc.44.10.1442
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.
