.png){kind=icon}
.png){kind=icon}
Return
The type E simple assembly line balancing problem: A mixed integer linear programming formulation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2015.05.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Although the simple assembly line balancing problem (SALBP) is the topic of many studies, typically they either consider minimizing the number of stations for a given cycle time (called type one), or minimizing the cycle time for a given number of stations (called type two). Rarely, type E of the problem has been considered. In the type E, cycle time and number of stations are both decision variables, and the objective is to maximize the line efficiency. This paper presents a mixed integer linear programming formulation for the type E simple assembly line balancing problem. Moreover, to further strengthen the presented formulation, two enhancement techniques in the form of valid inequalities and auxiliary variables are proposed. As the secondary objectives of the problem, minimization of the number of stations, the cycle time, and the smoothness index are studied as well. In the case of workload smoothing, three different linearization methods are employed and compared for minimizing the smoothness index. The results of computational study on the benchmark data set demonstrate the efficacy of the improved formulation (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Simple assembly line balancing
Workload smoothing
Linearization
Type E
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W