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

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

Author

Listed:
  • C. N. Potts

    (University of Southampton, Southampton, United Kingdom)

  • S. V. Sevast'janov

    (Russian Academy of Sciences, Novosibirsk, Russian Federation)

  • V. A. Strusevich

    (University of Greenwich, London, United Kingdom)

  • L. N. Van Wassenhove

    (INSEAD, Fontainebleau, France)

  • C. M. Zwaneveld

    (Erasmus University, Rotterdam, The Netherlands)

Abstract

This paper introduces a new two-stage assembly scheduling problem. There are m machines at the first stage, each of which produces a component of a job. When all m components are available, a single assembly machine at the second stage completes the job. The objective is to schedule jobs on the machines so that the makespan is minimized. We show that the search for an optimal solution may be restricted to permutation schedules. The problem is proved to be NP-hard in the strong sense even when m = 2. A schedule associated with an arbitrary permutation of jobs is shown to provide a worst-case ratio bound of two, and a heuristic with a worst-case ratio bound of 2 − 1/ m is presented. The compact vector summation technique is applied for finding approximation solutions with worst-case absolute performance guarantees.

Suggested Citation

  • C. N. Potts & S. V. Sevast'janov & V. A. Strusevich & L. N. Van Wassenhove & C. M. Zwaneveld, 1995. "The Two-Stage Assembly Scheduling Problem: Complexity and Approximation," Operations Research, INFORMS, vol. 43(2), pages 346-355, April.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:2:p:346-355
    DOI: 10.1287/opre.43.2.346
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.2.346
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.2.346?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
    ---><---

    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:43:y:1995:i:2:p:346-355. 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.