A Simple Optimality Proof of Moore's Sequencing Algorithm

L. B. J. M. Sturm
Additional contact information
L. B. J. M. Sturm: Interfaculty for Graduate Studies in Business Administration, Rotterdam, The Netherlands

Management Science, 1970, vol. 17, issue 1, 116-118

Abstract: In a recent article J. M. Moore [Moore, J. M. 1968. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 14(1, September) 102-109.] gave an algorithm for minimizing the number of late jobs in a one machine sequencing problem. As indicated by the author, T. J. Hodgson has proposed a simpler version of this algorithm, for which version the proof of optimality is similar to the proof given by the author for the original algorithm. In this note a simpler proof of optimality, based on the inductive principle, will be presented for Hodgson's algorithm. As Moore's algorithm only differs on minor points, this proof covers it as well.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.1.116 (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:17:y:1970:i:1:p:116-118

Access Statistics for this article

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