An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines - Rennes School of Business Access content directly
Journal Articles International Journal of Production Research Year : 2021

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

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.
No file

Dates and versions

hal-03160641 , version 1 (05-03-2021)

Identifiers

Cite

Öncü Hazir, Maher Agi, Jérémy Guérin. An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines. International Journal of Production Research, 2021, 59 (2), pp.617-634. ⟨10.1080/00207543.2019.1701208⟩. ⟨hal-03160641⟩
27 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More