Simple assembly line balancing?Heuristic approaches

Schöll, Armin; Voß, Stefan

doi:10.1007/bf00127358

Cited by 174 publications

(111 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The application of PRBP to different ALBPs has a long tradition (cf., e.g., Talbot et al, 1986;Boctor, 1995;Scholl and Voß, 1996). A large variety of priority rules and scheduling schemes have been tested for SALBP and other problem versions.…”

Section: Priority Rule Based Procedures (Prbp)mentioning

confidence: 99%

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

2011

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Priority Rule Based Procedures (Prbp)mentioning

confidence: 99%

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

2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…Most computational experiments reported in the literature indicate that, for SALBP, stationoriented procedures get better results than task-oriented ones though no theoretical dominance exists (Scholl and Voß, 1996). The eight simple heuristic rules that have been tested are based on the combination between following strategies and ordering rules:…”

Section: Heuristic Rules Definedmentioning

confidence: 99%

Balancing and scheduling tasks in assembly lines with sequence-dependent setup times

Andrés¹,

Miralles²,

Pastor³

2008

European Journal of Operational Research

147

109

View full text Add to dashboard Cite

The classical Simple Assembly Line Balancing Problem (SALBP) has been widely enriched over the past few years with many realistic approaches and much effort has been made to reduce the distance between the academic theory and the industrial reality. Despite this effort, the scheduling of the execution of tasks assigned to every workstation following the balancing of the assembly line has been scarcely reported in the scientific literature. This is supposed to be an operational concern that the worker should solve himself, but in several real environments, setups between tasks exist and optimal or near-optimal tasks schedules should be provided inside each workstation. The problem presented in this paper adds sequence-dependent setup time considerations to the classical SALBP in the following way: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time. After formulating a mathematical model for this innovative problem and showing the high combinatorial nature of the problem, eight different heuristic rules and a GRASP algorithm are designed and tested for solving the problem in reasonable computational time.

show abstract

“…Another heuristic method that starts an initial solution and realizes trade, and transfer procedures to improve this solution was proposed in [16]. Genetic algorithms [17]- [19], tabu search procedures [20], [21], simulated annealing algorithms [22], [23], ant colony optimization algorithms [24], [25], particle swarm optimization algorithm [26], differential evolution algorithm [27], [28], beam search algorithm [28]- [30] and variable neighbourhood search [31], [32] were also used to solve SALBP-II. In this paper, we propose a large neighbourhood search (LNS) algorithm for solving the SALBP-II.…”

Section: Introductionmentioning

confidence: 99%

Large neighbourhood search algorithm for type-II assembly line balancing problem

Akpınar¹

2017

Pamukkale J Eng Sci

View full text Add to dashboard Cite

show abstract

Simple assembly line balancing?Heuristic approaches

Cited by 174 publications

References 20 publications

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

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

Balancing and scheduling tasks in assembly lines with sequence-dependent setup times

Large neighbourhood search algorithm for type-II assembly line balancing problem

Contact Info

Product

Resources

About