IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v17y1970i1p116-118.html
   My bibliography  Save this article

A Simple Optimality Proof of Moore's Sequencing Algorithm

Author

Listed:
  • L. B. J. M. Sturm

    (Interfaculty for Graduate Studies in Business Administration, Rotterdam, The Netherlands)

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.

Suggested Citation

  • L. B. J. M. Sturm, 1970. "A Simple Optimality Proof of Moore's Sequencing Algorithm," Management Science, INFORMS, vol. 17(1), pages 116-118, September.
    • Handle: RePEc:inm:ormnsc:v:17:y:1970:i:1:p:116-118
    DOI: 10.1287/mnsc.17.1.116
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.1.116
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.17.1.116?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:17:y:1970:i:1:p:116-118. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.