ULINO: Optimally balancing U-shaped JIT assembly lines

Schöll, Armin; Klein, Robert

doi:10.1080/002075499191481

Cited by 143 publications

(81 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, as a consequence of the just-in-time production principles, recently many lines are being arranged in a U-line. Arranging the stations in a U-line has several advantages over the traditional configuration (Scholl and Klein, 1999). Demand fluctuations can be tackled easily by the U-line relative to the straight-line version due to increased search space.…”

Section: Introductionmentioning

confidence: 99%

“…SALOME is chosen as the basis of the ULINO, because it has been shown to be very effective in several computational tests (Scholl and Klein, 1999). ULINO is a branch and bound procedure that performs a depth-first They also state that with a little modification, the proposed algorithm can be applied to many variants of the problem.…”

Section: Ant Colony Optimization Meta-heuristicmentioning

confidence: 99%

“…To solve large size problems encountered in practice Scholl and Klein (1999) propose a new branch and bound procedure, ULINO, which is adapted from SALOME (previously developed algorithm for traditional straight line balancing problem). SALOME is chosen as the basis of the ULINO, because it has been shown to be very effective in several computational tests (Scholl and Klein, 1999).…”

Section: Ant Colony Optimization Meta-heuristicmentioning

confidence: 99%

“…As stated by Scholl and Klein (1999), the traditional type of 'straight' assembly lines have some problems. These are: monotone and boring type of work, low-level skilled, unmotivated operators, inflexibility of the production system concerning failures, the sensitivity to changing demand rates, and large inventories due to rigid output rates.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Section: Introductionmentioning

confidence: 99%

Section: Ant Colony Optimization Meta-heuristicmentioning

confidence: 99%

Section: Ant Colony Optimization Meta-heuristicmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

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

A balancing problem for mixed model assembly lines with a paced moving conveyor

Zhao¹,

Ohno²,

Lau³

2004

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line-balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line-balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology.

show abstract

ULINO: Optimally balancing U-shaped JIT assembly lines

Cited by 143 publications

References 0 publications

Ant colony optimization for the single model U-type assembly 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

A balancing problem for mixed model assembly lines with a paced moving conveyor

Contact Info

Product

Resources

About