2000 journal article
On satisfying due-dates in large job shops: Idle time insertion
IIE Transactions, 32(2), 177–180.
We consider the problem of minimizing maximum lateness in a job shop. A conceptually simple simulation based procedure described in a recent paper by Hodgson et al. [1] is modified to provide improved schedules. Computational experimentation is provided to identify the conditions under which the approach is most viable, and to report the procedure's performance on known test problems.