On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing

Rico Walter and Philipp Schulze

International Journal of Production Research, 2022, vol. 60, issue 15, 4654-4667

Abstract: Smoothing the workloads among the stations of an already installed assembly line is one of the major objectives in assembly line (re-)balancing. In order to find a feasible task-station assignment that distributes the total workload as equal as possible, two exact task-oriented branch-and-bound algorithms have recently been proposed. In this paper, we systematically analyse their effectiveness in solving the workload smoothing problem on simple assembly lines. In our experiments, we also examine the performance of a state-of-the-art mathematical programming solver and a ‘combined’ exact branch-and-bound procedure that integrates components of the two algorithms from the literature. In terms of theory, we show the equivalence of two recently developed local lower bounding arguments and suggest a slight improvement of the bound. We also propose an enhanced feasibility test.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2021.1934589 (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:60:y:2022:i:15:p:4654-4667

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

DOI: 10.1080/00207543.2021.1934589

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 ().