Bounds and approximations for cycle times of a U-shaped production line

Nakade, Koichi; Ohno, Katsuhisa; Shanthikumar, J. George

doi:10.1016/s0167-6377(97)00037-0

Cited by 18 publications

(8 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since the focus of this study is the U-shaped assembly line balancing problem (UALBP) with deterministic task times our literature review covers deterministic line balancing research. For discussions on various aspects of line flow research see Aase, Olson, and Schniederjans (2004), Celano et al (2004), Chand and Zeng (2001), Cheng, Miltenburg, and Motwani (2000), Miltenburg (2000;2001a;2001b), Nakade and Ohno (1995;1999;, Nakade, Ohno, and Shanthikumar (1997), and Ohno and Nakade (1997). Miltenburg (1998) attributed the first discussion in the open literature in English concerning U-lines to Schonberger (1982) who noticed a preference among Japanese manufacturers for multiple U-lines, where workstations often spanned more than one U-line.…”

Section: U-shaped Assembly Line Balancing Literature Reviewmentioning

confidence: 99%

An empirical comparison of improvement heuristics for the mixed-model U-line balancing problem

Visich¹,

Khumawala²,

Diaz-Saiz³

2010

IJMTM

View full text Add to dashboard Cite

Mixed-model assembly lines often create model imbalance due to differences in task times for the different product models. Smoothing algorithms guided by meta-heuristics that can escape local optimums can be used to reduce model imbalance. In this research we utilize the metaheuristics tabu search (TS), the great deluge algorithm (GDA) and record-to-record travel (RTR) to reduce three objective functions: the absolute deviation from cycle time, the maximum deviation from cycle time, and the sum of the cycle time violations. We found that the GDA was significantly superior to the RTR and TS algorithms across all problem sizes and objective functions. For the 19 task problems, RTR performed significantly better than TS for all three objective functions. On the other hand, for the 61 and 111 task problems TS performed significantly better than RTR for all three objective functions.

show abstract

Section: U-shaped Assembly Line Balancing Literature Reviewmentioning

confidence: 99%

An empirical comparison of improvement heuristics for the mixed-model U-line balancing problem

Visich¹,

Khumawala²,

Diaz-Saiz³

2010

IJMTM

View full text Add to dashboard Cite

show abstract

“…In the U-type assembly line literature, there are a number of test problems used by several researchers (Scholl and Klein, 1999 classify these problems into three data sets: Talbot et al, 1986;Hoffmann, 1990Hoffmann, , 1992Scholl, 1993). These data sets are available at: Wee-mag (75 tasks, C = 28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,49,50,52,54,56);…”

Section: Cycle Time (C) Task Processing Times (T) and Number Of Taskmentioning

confidence: 99%

Ant colony optimization for the single model U-type assembly line balancing problem

Sabuncuoğlu

Erel

Alp

2009

International Journal of Production Economics

View full text Add to dashboard Cite

The assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is the allocation of tasks to an ordered sequence of stations subject to the precedence constraints with the objective of minimizing the number of stations. In a U-line the line is configured into a U-shape topology.In this research, a new heuristic, Ant Colony Optimization (ACO) meta-heuristic, and its variants are proposed for the single model U-type assembly line balancing problem (UALBP). We develop a number of algorithms that can be grouped as:(i) direct methods, (ii) modified methods and (iii) methods in which ACO approach is augmented with some metaheuristic.We also construct an extensive experimental study and compare the performance of the proposed algorithms against the procedures reported in the literature. Ayrıca kapsamlı bir deneysel çalışma yapılmış ve önerilen algoritmaların performansı literatürdeki diğer metodlarla karşılaştırılmıştır.Anahtar sözcükler: U-tipi montaj hattı dengelenmesi problemi, Karınca KolonisiOptimizasyonu meta-sezgiseli.iv

show abstract

“…A station which handles the same workpiece in two different cycles is called a crossover station. With a U-line, the number of required stations can be smaller than with a regular line (for more details on the UALBP see Miltenburg and Wijngaard, 1994;Nakade et al, 1997;Sparling and Miltenburg, 1998;Urban, 1998;Scholl and Klein, 1999;Miltenburg, 2000;Erel et al, 2001;Chiang and Urban, 2006;.…”

Section: Main Contributionsmentioning

confidence: 99%

A survey of the literature on the multiple or parallel assembly line balancing problem

Lusa

2008

EJIE

View full text Add to dashboard Cite

show abstract

Bounds and approximations for cycle times of a U-shaped production line

Cited by 18 publications

References 2 publications

An empirical comparison of improvement heuristics for the mixed-model U-line balancing problem

An empirical comparison of improvement heuristics for the mixed-model U-line balancing problem

Ant colony optimization for the single model U-type assembly line balancing problem

A survey of the literature on the multiple or parallel assembly line balancing problem

Contact Info

Product

Resources

About