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

MoreLess

Year of publication:	1998
Authors:	Hodgson, Thom J. ; Cormier, Denis ; Weintraub, Alexander J. ; Zozom, Andrew
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 44.1998, 10, p. 1442-1446
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	Job Shop Scheduling \| Maximum Lateness \| Simulation

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.44.10.1442 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009203857