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

Öncü Hazir, Maher Agi and Jérémy Guérin
Additional contact information
Ö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

Post-Print from HAL

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.

Keywords: assembly line balancing; branch and bound; exact algorithms; workload smoothing (search for similar items in EconPapers)
Date: 2021-01-17
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Published in International Journal of Production Research, 2021, 59 (2), pp.617-634. ⟨10.1080/00207543.2019.1701208⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-03160641

DOI: 10.1080/00207543.2019.1701208

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().