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.