An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines. Issue 2 (17th January 2021)

• Record Type: Journal Article
• Authors: Hazır, Öncü; Agi, Maher A. N.; Guérin, Jérémy
• Is Part Of: International journal of production research. Volume 59:Issue 2(2021)
• Page Start: 617
• Page End: 634
• Publication Date: 2021-01-17
• Subjects: assembly line balancing -- branch and bound -- exact algorithms -- workload smoothing; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2019.1701208
• Languages: English
• ISSNs: 0020-7543

Abstract

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.