A branch-and-bound method for the bi-objective simple line assembly balancing problem.
Saved in:
| Title: | A branch-and-bound method for the bi-objective simple line assembly balancing problem. |
|---|---|
| Authors: | Cerqueus, Audrey1 (AUTHOR) audrey.cerqueus@emse.fr, Delorme, Xavier1 (AUTHOR) |
| Source: | International Journal of Production Research. Sep2019, Vol. 57 Issue 18, p5640-5659. 20p. 5 Diagrams, 2 Charts, 5 Graphs. |
| Subjects: | Assembly line balancing, Assembly line methods, Problem solving |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2018.1539266 |
