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.

Similar works

Full text


Research Papers in Economics

Last time updated on 06/07/2012

This paper was published in Research Papers in Economics.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.