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

Öncü Hazır, Maher A. N. Agi and Jérémy Guérin

International Journal of Production Research, 2021, vol. 59, issue 2, 617-634

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2019.1701208 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:59:y:2021:i:2:p:617-634

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2019.1701208

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().