Analysis of an assembly line by mixed integer programming and discrete event-based simulation

A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors

“…The focus of the research in this area has been on proposing metaheuristic methods and competitive algorithms like evolution strategies and ANNs, grouping evolution strategies, particle swarm optimization, honey bee optimization, genetic algorithms, beam search algorithm, differential evolution approach, ant colony algorithm, and local search algorithm, in the recent decade [ 10 , [22] , [23] , [24] , [25] , [26] , [27] , [28] , [29] , [30] , [31] ]. In addition to the mentioned literature, several exact methods like the branch & bound [ 32 ], linear programming [ 33 ], dynamic programming [ 34 ], integer programming [ 35 ], and mixed-integer programming [ 36 ], were proposed to solve different types of ALBPs. Recently, Fleszar [ 37 ] developed a mixed-integer linear programming (MILP) model for two different ALBPs.…”