The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics

Abstract

Assembly line balancing problems (ALBP) consist of distributing the total workload for manufacturing any unit of the products to be assembled among the work stations along a manufacturing line as used in the automotive or the electronics industries.Usually, it is assumed in research papers that, within each station, tasks can be executed in an arbitrary precedence-feasible sequence without changing station times. In practice, however, the task sequence may influence the station time considerably as sequence-dependent setups (e.g., walking distances, tool changes, withdrawal of parts from material boxes) have to be considered. Including this aspect leads to a joint balancing and scheduling problem, which we call SUALBSP (setup assembly line balancing and scheduling problem). In this paper, we modify the problem by modeling setups more realistically, give a new, more compact mathematical model formulation and develop effective heuristic solution procedures. Computational experiments based on existing and new data sets indicate that the new procedures outperform formerly proposed heuristics and are able to solve problem instances of real-world size with small deviations from optimality in short time.

An outer approximation method for an integration of supply chain network designing and assembly line balancing under uncertainty

“…Lee, Kim, and Kim (2001) studied the two sided assembly line balancing problem with consideration of work relatedness and work slackness. Agpak and Gökçen (2005) addressed assembly lines with resource constraints, Andrés, Miralles, and Pastor (2008) studied assembly lines with setup times between tasks, Scholl, Boysen, and Fliedner (2013) extended the problem by differentiating between forward and backward setup times. Yolmeh and Kianfar (2012) studied the second type of the problem proposed by Scholl et al (2013), they proposed a genetic algorithm to efficiently solve this problem.…”

An Approach to Schedule Production using the Reservation Tables

“…The idea of reengineering is actual one as the information technology is constantly changing. Production scheduling can be defined as the allocation of available production resources over time to best satisfy some set of criteria [1][2][3]. Generally speaking, the scheduling problems are NP-hard.…”

“…Different aspects of balancing and scheduling problems are deeply discussed in the literature [3][4][5][6][7][8][9][10]. An excellent classification of ALBP is given in [6].…”

Assembly Line Balancing Problem with Stochastic Sequence-Dependent Setup Times

“…Çünkü hazırlık zamanları ile görev zamanları karşılaştırıldığında çok düşük değerlere sahip olduğu düşünülmektedir [4]. Ancak, bir otomobil üreticisinde yapılan bir araştırma yürüme ve geri çekilme sürelerinin toplam üretim süresinin yaklaşık %10-15 oranında yer tuttuğunu göstermiştir [3]. Ayrıca, çevrim zamanının küçük olduğu sistemlerde hazırlık zamanları toplam istasyon süresinin önemli bir kısmını oluşturacaktır [4].…”