IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v23y1976i1p125-129.html
   My bibliography  Save this article

Scheduling to minimize the weighted sum of completion times with secondary criteria

Author

Listed:
  • Richard N. Burns

Abstract

A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems.

Suggested Citation

  • Richard N. Burns, 1976. "Scheduling to minimize the weighted sum of completion times with secondary criteria," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(1), pages 125-129, March.
    • Handle: RePEc:wly:navlog:v:23:y:1976:i:1:p:125-129
    DOI: 10.1002/nav.3800230111
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800230111
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800230111?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.

    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:wly:navlog:v:23:y:1976:i:1:p:125-129. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.