Combinatorial Benders decomposition for mixed-model two-sided assembly line balancing problem

In this work, we consider a mixed-model two-sided assembly line balancing problem for a given cycle time (MTALBP-I), in which the primary objective is to minimise the number of mated-stations (i.e. the length of the two-sided assembly line), while the number of stations, which describes the total nu...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2022-04, Vol.60 (8), p.2598-2624
Main Authors: Huang, Dian, Mao, Zhaofang, Fang, Kan, Yuan, Biao
Format: Article
Language:English
Subjects:
Algorithms
assembly line balancing
Assembly lines
Balancing
Benders decomposition
Combinatorial analysis
combinatorial Benders decomposition
Cycle time
Exact solutions
mixed integer linear programming
Mixed-model production
two-sided assembly lines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work, we consider a mixed-model two-sided assembly line balancing problem for a given cycle time (MTALBP-I), in which the primary objective is to minimise the number of mated-stations (i.e. the length of the two-sided assembly line), while the number of stations, which describes the total number of operators, is also concerned. To solve this problem, we propose a combinatorial Benders decomposition-based exact algorithm, and develop a sequence-based enumerative search method to calculate effective combinatorial Benders cuts. To evaluate the performance of our proposed solution approach, we conduct extensive computational experiments on a set of benchmark instances, and the results demonstrate its efficiency of finding exact solutions even for large-sized instances.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2021.1901152