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

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

Author

Listed:
  • V. Srinivasan

Abstract

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relationships among pairs of jobs (whenever possible) and eliminates the first and the last few jobs in an optimal sequence. The remaining jobs are then ordered by incorporating the precedence relationships in a dynamic programming framework. Propositions are proved which considerably reduce the total computation involved in the dynamic programming phase. Computational results indicate that the solution time goes up less than linearly with the size (n) of the problem. The median solution time for solving 50 job problems was 0.36 second on UNIVAC 1108 computer.

Suggested Citation

  • V. Srinivasan, 1971. "A hybrid algorithm for the one machine sequencing problem to minimize total tardiness," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(3), pages 317-327, September.
    • Handle: RePEc:wly:navlog:v:18:y:1971:i:3:p:317-327
    DOI: 10.1002/nav.3800180304
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800180304
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800180304?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. Ricardo Soto & Broderick Crawford & Rodrigo Olivares & César Carrasco & Eduardo Rodriguez-Tello & Carlos Castro & Fernando Paredes & Hanns de la Fuente-Mella, 2020. "A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    2. Johnny C. Ho & Yih‐Long Chang, 1991. "Heuristics for minimizing mean tardiness for m parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 367-381, June.

    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:18:y:1971:i:3:p:317-327. 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.