Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders' decomposition approach. Issue 1 (2nd January 2022)

• Record Type: Journal Article
• Authors: Furugi, Ahad
• Is Part Of: Engineering optimization. Volume 54:Issue 1(2022)
• Page Start: 170
• Page End: 184
• Publication Date: 2022-01-02
• Subjects: Sequence-dependent set-up time -- assembly line balancing problem -- Benders' decomposition -- combinatorial Benders' cut; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2021.1953003
• Languages: English
• ISSNs: 0305-215X

Abstract

Abstract : This article deals with the cost-oriented assembly line balancing problem with sequence-dependent set-up times. To this end, a mixed-integer linear programming (MILP) model is proposed for time- and cost-oriented assembly line balancing problems with sequence-dependent set-up times between tasks. The problem is computationally intractable; therefore, a Benders' decomposition algorithm is developed to solve it. The proposed decomposition yields a master problem that addresses the issue of assigning assembly tasks to workstations, as well as a set of subproblems that deal with sequencing tasks within each workstation owing to sequence-dependent set-up times. The algorithm is tested on a set of randomly generated test problems and numerically compared with a MILP formulation of the problem solved using a commercial optimizer. The computational results demonstrate that the proposed Benders' decomposition approach outperforms the MILP model. The contribution of this article lies in the new models proposed and the decomposition-based exact algorithm developed.