Satisfying due dates in large job shops

Satisfying due dates in large job shops

0.00 Avg rating0 Votes
Article ID: iaor2000830
Country: United States
Volume: 44
Issue: 10
Publication Date: Oct 1998
Journal: Management Science
Authors: , , ,
Keywords: simulation: applications
Abstract:

For the multi-machine job shop scheduling problem, a conceptually simple simulation-based procedure (first proposed by Lawrence and Morton) 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.

Reviews

Required fields are marked *. Your email address will not be published.