A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace

Abstract

The assembly line balancing problem can completely vary from one production line to the other. This paper deals with a realistic assembly line for the automotive industry inspired by Fiat Chrysler Automotive in North America and Parskhodro in Iran (both large-scale automotive companies). This problem includes some specific requirements that have not been studied in the literature. For example, the assembly line is five-sided, and workers can move along these sides. Due to the limited workspace, all the sides cannot work simultaneously at one station. First, a mixed integer linear programming model is proposed for the problem. Then, the model is improved to have a tighter linear relaxation. Moreover, an effective logic-based Benders’ decomposition algorithm is developed. After careful analysis of problem’s structure, three propositions are introduced. The master problem is well restricted by eight valid inequalities. Two different sub-problem types are defined to extract more information from the master problem’s solution. In this case, the algorithm adds effective cuts that reduce the solution space to the extent possible at each iteration. Thus, the number of iterations is significantly cut down. The performance of the model and algorithm, as well as improvement made on both, is evaluated.

Keywords:

• assembly line balancing
• multi-manned
• mixed model
• mixed integer linear programming
• logic-based benders’ decomposition
• valid inequalities
• benders’ cuts

Acknowledgements

The authors are grateful to the Research Deputy of Kharazmi University for their support.

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada [grant number 811008].