A branch-and-bound method for the bi-objective simple line assembly balancing problem

Abstract : The design of a production system is a strategic level decision. One of the key problems to solve is the line balancing problem that determines the efficiency of a production or assembly line. This class of problem has been widely studied in the literature. It determines important features, such as the number of stations, the takt time or the working conditions. Most of the variants of this problem consider only one objective function, but nowadays companies have to take into account different criteria. In this study, we consider a bi-objective variant of the simple assembly line balancing problem. We present a generic branch-and-bound method to solve exactly this problem. The objective functions are to minimise the takt time and the number of stations. To do so, bounds and bound sets are developed. The resulting method is numerically tested and compared to an ϵ-constraint method. These experiments show that the bi-objective branch-and-bound algorithm outperforms an ϵ-constraint method using a state-of-the-art single objective algorithm for more than 80% of the instances. Finally, we propose an analysis of the cases where the branch-and-bound method is outperformed.
Document type :
Journal articles
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01961748
Contributor : Florent Breuil <>
Submitted on : Thursday, December 20, 2018 - 10:45:57 AM
Last modification on : Friday, March 15, 2019 - 1:14:54 AM

Identifiers

Citation

Audrey Cerqueus, Xavier Delorme. A branch-and-bound method for the bi-objective simple line assembly balancing problem. International Journal of Production Research, Taylor & Francis, 2018, pp.1-20. ⟨10.1080/00207543.2018.1539266⟩. ⟨emse-01961748⟩

Share

Metrics

Record views

36