 |
Journal articles
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.
https://hal-rennes-sb.archives-ouvertes.fr/hal-03160641
Contributor : Steven Gouin Connect in order to contact the contributor
Submitted on : Friday, March 5, 2021 - 1:42:02 PM
Last modification on : Saturday, March 6, 2021 - 3:23:32 AM
Contributor : Steven Gouin Connect in order to contact the contributor
Submitted on : Friday, March 5, 2021 - 1:42:02 PM
Last modification on : Saturday, March 6, 2021 - 3:23:32 AM