Assembly line balancing algorithms: computation comparisons

Johnson, Roger V.

doi:10.1080/00207548108956654

Cited by 45 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that the ALBP has been a hot topic for researchers. Subsequent works however, attempted to extend the problem by considering practice relevant characteristics, like U-shaped lines, parallel stations or processing alternatives [3,4].…”

Section: Introductionmentioning

confidence: 98%

Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

Mozdgir

Mahdavi

Seyedi

et al. 2013

Mathematical and Computer Modelling

View full text Add to dashboard Cite

a b s t r a c tAn assembly line is a flow-oriented production system in which the productive units performing the operations, referred to as stations, are aligned in a serial manner. The simple assembly line balancing problem (SALBP) is a fundamental version of the general problem which has attracted attention of researchers and practitioners of operations research for almost half a century. With respect to the objective function, the SALBP is further classified into SALBP-1, SALBP-2, SALBP-E and finally SALBP-F. The types of SALBP may be complemented by a secondary objective which consists of smoothing station loads. This objective guarantees a better flow of material.Although there is a great deal of research addressing this problem, most of them consider smoothing station loads as a primary objective. In this paper, a differential evolution algorithm is developed to minimize workload smoothness index in SALBP-2. Also, the algorithm parameters are optimized using the Taguchi method. To validate the proposed algorithm, the results are compared with those of a published heuristic. This comparison indicates effectiveness of the proposed algorithm.

show abstract

Section: Introductionmentioning

confidence: 98%

Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

Mozdgir

Mahdavi

Seyedi

et al. 2013

Mathematical and Computer Modelling

View full text Add to dashboard Cite

show abstract

“…Talbot and Patterson (1984), based on additive algorithm ofBalas (1965): FW, LS, reduction tests based on LM1, TI• Saltzman and Baybars (1987): parallel FW-BW, LS, RN, LM1,5, LM2,3 modified likeJohnson (1981), TI, HS • FABLE,Johnson (1988Johnson ( , 1993: FW, LS, RN, LM1-4, ML, JD, FS (restricted), TI, SO • Nourie and Venta (1991, 1996): branching like FABLE, FW, LS, RN, LM1, ML, FS, HS • Sprecher (1999): branching like FABLE, FW-BW (static direction switching), LS, RN, LM1-6, ML, JD, FS, TI, SO • Sprecher (2003): distributed version of Sprecher (1999) for parallel computers MLB • Jaeschke (1964): FW, LM1, ML • Van Assche and Herroelen (1979): FW, LM1, ML, FS (restricted) • Hackman et al (1989): FW, LM1, ML, FS (restricted), HS LLBM…”

mentioning

confidence: 99%

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

Schöll¹,

Becker²

2006

European Journal of Operational Research

704

330

View full text Add to dashboard Cite

“…Heuristic algorithms for the time-oriented assembly line balancing problem are investigated by Johnson (1981), Talbot, Patterson and Gehrlein (1986). As the NP-hard one-dimensional bin packing problem (Garey and Johnson (1979), pp.…”

Section: Examplementioning

confidence: 99%

A comparison of heuristic algorithms for cost-oriented assembly line balancing

Rosenberg

Ziegler

1992

ZOR - Methods and Models of Operations Research

View full text Add to dashboard Cite

Abstract." Two new heuristic algorithms for solving cost-oriented assembly line balancing problems -the Wage-Rate-Method (WR) and the Wage-Rate-Smoothing-Method (WRS) -are presented and compared with two known heuristics -the Positional-Weight-Method (PW) and the PositionalWeight-Wage-Rate-Difference-Method (PWWD) with respect to their solution qualities. Firstly, the heuristics are outlined and their computational effort is stated. Then, a theoretical worst-case bound for the solution quality is given and the results of an extensive performance study are reported. In the study the heuristics were investigated with respect to their solution quality by solving randomly generated line balancing problems and problems from literature. It can be concluded that PWWD and WRS are generally superior to PW and WR.

show abstract

Assembly line balancing algorithms: computation comparisons

Cited by 45 publications

References 0 publications

Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

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

A comparison of heuristic algorithms for cost-oriented assembly line balancing

Contact Info

Product

Resources

About