Note. Satisfying Due Dates in Large Job Shops

Thom J. Hodgson, Denis Cormier, Alexander J. Weintraub and Andrew Zozom
Additional contact information
Thom J. Hodgson: Furniture Manufacturing and Management Center, Industrial Engineering Department, North Carolina State University, Raleigh, North Carolina 27695-7906
Denis Cormier: Furniture Manufacturing and Management Center, Industrial Engineering Department, North Carolina State University, Raleigh, North Carolina 27695-7906
Alexander J. Weintraub: Furniture Manufacturing and Management Center, Industrial Engineering Department, North Carolina State University, Raleigh, North Carolina 27695-7906
Andrew Zozom: Furniture Manufacturing and Management Center, Industrial Engineering Department, North Carolina State University, Raleigh, North Carolina 27695-7906

Management Science, 1998, vol. 44, issue 10, 1442-1446

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

Keywords: Job Shop Scheduling; Maximum Lateness; Simulation (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.44.10.1442 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:44:y:1998:i:10:p:1442-1446

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().