IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v23y1975i1p118-136.html
   My bibliography  Save this article

A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems

Author

Listed:
  • Ergin Uskup

    (Clow Corporation, Oak Brook, Illinois)

  • Spencer B. Smith

    (Illinois Institute of Technology, Chicago, Illinois)

Abstract

This paper presents an algorithm for determining an optimum solution to a two-stage production sequencing problem with these characteristics: There are n jobs to be sequenced in a two-stage production environment; each production stage is equipped with a single facility; jobs to be sequenced are subject to due-date constraints; facilities in both stages require setup prior to processing each job; setup times in both stages are sequence dependent, and setup cost is assumed to be directly proportional to setup time; and the optimal solution is one that minimizes the total setup cost (of stages I and II) without violating job-due dates. The algorithm employs controlled enumeration through branch-and-bound procedures, together with feasibility tests.

Suggested Citation

  • Ergin Uskup & Spencer B. Smith, 1975. "A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems," Operations Research, INFORMS, vol. 23(1), pages 118-136, February.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:1:p:118-136
    DOI: 10.1287/opre.23.1.118
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.1.118
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.1.118?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. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Other publications TiSEM 0cf065b7-4836-4cdd-9317-0, Tilburg University, School of Economics and Management.
    2. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
    3. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Research Memorandum FEW 579, Tilburg University, School of Economics and Management.

    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:oropre:v:23:y:1975:i:1:p:118-136. 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.