Note—On the Sequencing of <i>n</i> 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.

• 저널Management Science · 18(7) · 389–389
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.18.7.389
• 저자Salah E. Elmaghraby