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

Salah E. Elmaghraby
Additional contact information
Salah E. Elmaghraby: North Carolina State University

Management Science, 1972, vol. 18, issue 7, 389-389

Abstract: 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.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.7.389 (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:18:y:1972:i:7:p:389-389

Access Statistics for this article

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