Note--On the Sequencing of n Jobs on One Machine to Minimize the Number of Jobs Late

In a recent paper [Moore, J. M. 1968. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15(1, September).] Moore addressed himself to the problem of the title, and devised a rather simple algorithm for its solution. He also mentions a somewhat simpler algorithm suggested by Hodgson. The proof of both algorithms is rather involved. The following is a more direct, and hopefully simpler, proof.

MoreLess

Year of publication:	1972
Authors:	Elmaghraby, Salah E.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 18.1972, 7, p. 389-389
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

More details

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

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