IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03160641.html
   My bibliography  Save this paper

An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines

Author

Listed:
  • Öncü Hazir

    (ESC [Rennes] - ESC Rennes School of Business)

  • Maher Agi

    (ESC [Rennes] - ESC Rennes School of Business)

  • Jérémy Guérin

    (ESC [Rennes] - ESC Rennes School of Business)

Abstract

In this study, we develop a branch and bound solution algorithm to solve the workload smoothing problem. Our algorithm incorporates new formulas for dynamically computing a lower bound on the optimal value of the objective function and for determining the earliest workstations for tasks. It also uses a fast heuristic for computing a good initial upper bound. A comprehensive experimental analysis is conducted in this study. The analysis demonstrates the outstanding performance of the algorithm and its efficiency in solving medium-sized workload smoothing problems.

Suggested Citation

  • Öncü Hazir & Maher Agi & Jérémy Guérin, 2021. "An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines," Post-Print hal-03160641, HAL.
    • Handle: RePEc:hal:journl:hal-03160641
    DOI: 10.1080/00207543.2019.1701208
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anel, Juan Ignacio & Català, Pau & Serra, Moisès & Domenech, Bruno, 2022. "New Matrix Methodology for Algorithmic Transparency in Assembly Line Balancing Using a Genetic Algorithm," Operations Research Perspectives, Elsevier, vol. 9(C).
    2. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    3. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    4. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).

    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:hal:journl:hal-03160641. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.