Survey Paper We Discuss The Development Of The Simple Assembly Line Balancing Problem (Salbp)
Due to the richness of the literature, we exclude fromdiscussion here (a) the inexact (i.e., heuristic/approximate) algorithms for SALPB and (b) the algorithms for the general assembly line balancing problem (including the stochastic models).
Assembly linedesign with incompatible task assignments
Assembly lines are widely used for the mass production of consumer goods and components in large volume production systems. Design of these lines warrantstaking into consideration not only cycle time and precedence constraints, but also other restrictions. An important recurring restriction is that some pairs of tasks cannot be assigned to the samestation due to factors such as safety, physical demands placed on workers, quality, and technological considerations. We investigate this problem and a current industry practice used for solving thisproblem. Our investigation of this problem yields three findings. First, we identify a new class of heuristic procedures which dynamically updates task priorities. Our investigations show that this classof heuristics yields better results. Second, extremely greedy procedures such as knapsack heuristics (Hoffmann procedure) continue to perform better than competing heuristics for industrial grade...
Regístrate para leer el documento completo.