IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v32y2024i2d10.1007_s11750-024-00664-0.html
   My bibliography  Save this article

On the two-stage assembly flow shop problem

Author

Listed:
  • Hatem Hadda

    (Université de Tunis El Manar, Ecole Nationale d’Ingénieurs de Tunis, OASIS)

  • Najoua Dridi

    (Université de Tunis El Manar, Ecole Nationale d’Ingénieurs de Tunis, OASIS)

  • Sonia Hajri-Gabouj

    (LISI, INSAT, Centre Urbain Nord)

Abstract

Numerous operational constraints within both industry and service sectors mandate the concurrent scheduling of tasks. This need is particularly evident in the assembly of products within manufacturing processes. This paper concentrates on minimizing makespan in the two-stage assembly flow shop problem. Our contributions include the introduction of novel dominance rules, a proposal for a heuristic method, and the development of a branch and bound algorithm. Additionally, we conduct an empirical analysis of makespan distribution for small-size instances. Through extensive experimentation, our study demonstrates the efficiency of the introduced dominance rules and the strong performance of the developed branch and bound algorithm.

Suggested Citation

  • Hatem Hadda & Najoua Dridi & Sonia Hajri-Gabouj, 2024. "On the two-stage assembly flow shop problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(2), pages 224-244, July.
    • Handle: RePEc:spr:topjnl:v:32:y:2024:i:2:d:10.1007_s11750-024-00664-0
    DOI: 10.1007/s11750-024-00664-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-024-00664-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11750-024-00664-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:topjnl:v:32:y:2024:i:2:d:10.1007_s11750-024-00664-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.