scispace - formally typeset
Open AccessJournal ArticleDOI

A survey of the assembly line balancing procedures

Erdal Erel, +1 more
- 01 Jan 1998 - 
- Vol. 9, Iss: 5, pp 414-434
Reads0
Chats0
TLDR
The heuristic procedures of the assembly line balancing problem are critically examined and summarized in sufficient detail to provide a state-of-the-art survey.
Abstract
The assembly line balancing problem consists of assigning tasks to an ordered sequence of stations such that the precedence relations among the tasks are satisfied and some performance measure is optimized. Due to the complexity of the problem, heuristic procedures appear to be more promising than the optimum-seeking algorithms. For the single-model, deterministic version, there are numerous exact and heuristic algorithms developed, while for the other more complex but more realistic versions, the research published consists mainly of heuristic procedures. In this paper, the heuristic procedures are critically examined and summarized in sufficient detail to provide a state-of-the-art survey. An evaluation of the procedures and some further research topics have also been presented.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A survey on problems and methods in generalized assembly line balancing

TL;DR: The developments in GALBP research is surveyed in order to describe and solve more realistic generalized problems (GALBP) and to survey the developments in assembly line balancing research.
Journal ArticleDOI

State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

TL;DR: This paper gives an up-to-date and comprehensive survey of SALBP research with a special emphasis on recent outstanding and guiding contributions to the field.
Journal ArticleDOI

A classification of assembly line balancing problems

TL;DR: To ease communication between researchers and practitioners, a classification scheme of assembly line balancing is provided, which is a valuable step in identifying remaining research challenges which might contribute to closing the gap.
Posted Content

A classification of assembly line balancing problems

TL;DR: In this paper, a classification scheme of assembly line balancing problems is proposed to ease communication between researchers and practitioners, and a valuable step in identifying remaining research challenges which might contribute to closing the gap between requirements of real configuration problems and the status of research.
Journal ArticleDOI

A taxonomy of line balancing problems and their solutionapproaches

TL;DR: The objective of this survey is to analyze recent research on balancing flow lines within many different industrial contexts in order to classify and compare the means for input data modelling, constraints and objective functions used.
References
More filters
Journal ArticleDOI

Parallel Sequencing and Assembly Line Problems

T. C. Hu
- 01 Dec 1961 - 
TL;DR: This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability, and how to arrange a schedule that requires the minimum number of men to complete all jobs within a prescribed time T.
Journal ArticleDOI

A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems

TL;DR: In this article, the authors present a comprehensive review and analysis of the assembly line balancing literature at both the strategic and tactical levels, focusing on qualitative and quantitative factors that could impact the design, balancing and scheduling of assembly systems.
Journal ArticleDOI

An Algorithm for the Line Balancing Problem

TL;DR: An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem and the algorithm is compared with prior analytical methods of line balancing.
Journal ArticleDOI

A Computing Procedure for a Line Balancing Problem

TL;DR: The purpose of the present paper is to set forth an enumeration procedure for solving one of the problems concerned with setting up production lines and to clarify the assumptions in its statement.
Journal ArticleDOI

Line Balancing-Sequencing for Mixed-Model Assembly

TL;DR: This paper describes a procedure of adapting single-model line balancing techniques to mixed-model schedules and introduces a sequencing procedure for determining the order in which models are to flow down the line.
Related Papers (5)
Frequently Asked Questions (12)
Q1. What have the authors contributed in "A survey of the assembly line balancing procedures" ?

In this paper, the heuristic procedures are critically examined and summarized in su cient detail to provide a state-of-the-art survey. An evaluation of the procedures and some further research topics have also been presented. 

Thus, developing procedures for the solution of SMS, MMD and MMS versions of the problem that are both capable of solving problem sizes and ¯ exible to model the actual conditions encountered in practice constitutes a future research area. Developing procedures that consider the new developments in the learning and the forgetting e ect for the mixed/multi model lines, and conducting studies that examine the e ects of these phenomena on the line balance are further research areas. Several directions for future research on the U-line balancing problem exist, including studying SMS lines and considering various new objectives. Having di erent learning rates for the tasks assigned to di erent stations will distort the work allocation of even the perfectly balanced lines. 

Stochasticity of the task times, requirement of task groupings according to task skill levels, andmixed-model situations are among the modi® cations considered. 

Due to the excessive number of constraints and variables, they have concluded that theformulation is of more theoretical than practical interest. 

The performance of the procedure depends on the setting of various parameters, e.g. the rate of cooling and the number of con® guration changes. 

The `hybrid line’ concept suggested by Lau and Shtub (1987) seems to have the potential of generating designs with lower total costs and needs to be further studied. 

Four sets of problems are generated for comparison purposes: the ® rst set consists of sixty 50-task and sixty 100-task problems with di erent order strengths, cycle times and task times. 

The authors claim that the results above have been achieved with 500 iterations; if it had been with more iterations, more than 14 problems would have outperformed. 

The mean duration time of a task is assumed to be a non-increasing discrete function of the number of workers at the station to which the task is assigned. 

The second group consists of heuristic procedures that utilize principles or devices that contribute to the reduction of search in the problem-solving activity at a cost of not guaranteeing the optimal solution. 

Past dataare utilized to determine the proportional occurrences of the model variations, which form the weight factor to be used for calculating ¹is and s 2 i s. 

Kim and Park (1995) state that another motivation to develop heuristic procedures is that the task times utilized in these procedures are usually rough estimates which do not account for the variability between workers and throughout time; thus, obtaining a g̀ood’ solution rather than the optimal one may be acceptable to the practitioners.