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

An Algorithm for Solving Job Sequencing Problems

Author

Listed:
  • J. T. Presby

    (Touche, Ross, Bailey & Smart)

  • M. L. Wolfson

    (United States Steel Corporation)

Abstract

The technique described in this paper was devised for sequencing jobs on individual machines having characteristics of: (1) high job changeover costs; (2) small backlogs (10-20 jobs); (3) occasional "rush" orders. The algorithm starts with four-job sequences and from these constructs five-job sequences; from the five-job sequences, six-job sequences are constructed, and so on. At each stage, a large fraction of sequences are eliminated from further consideration. This elimination process makes the computation feasible because the number of all possible sequences becomes unmanageably large, even for small problems. The technique always provides a minimum cost sequence. It also permits determination of optimum sequences of backlog sub-sets; thus, rush orders can be accommodated and anticipated changes in the job backlog can be recognized.

Suggested Citation

  • J. T. Presby & M. L. Wolfson, 1967. "An Algorithm for Solving Job Sequencing Problems," Management Science, INFORMS, vol. 13(8), pages 454-464, April.
    • Handle: RePEc:inm:ormnsc:v:13:y:1967:i:8:p:b454-b464
    DOI: 10.1287/mnsc.13.8.B454
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.13.8.B454
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.13.8.B454?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. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.

    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:13:y:1967:i:8:p:b454-b464. 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.