Balancing of U-type assembly systems using simulated annealing

The paper presents a new simulated annealing (SA)-based algorithm for the assembly line-balancing problem with a U-type configuration. The proposed algorithm employs an intelligent mechanism to search a large solution space. U-type assembly systems are becoming increasingly popular in today's modern production environments since they are more general than the traditional assembly systems. In these systems, tasks are to be allocated into stations by moving forward and backward through the precedence diagram in contrast to a typical forward move in the traditional assembly systems. The performance of the algorithm is measured by solving a large number of benchmark problems available in the literature. The results of the computational experiments indicate that the proposed SA-based algorithm performs quite effectively. It also yields the optimal solution for most problem instances. Future research directions and a comprehensive bibliography are also provided here.

[1]  David Sparling.  Balancing Just-In-Time Production Units: The N U-Line Balancing Problem , 1998 .

[2]  Thomas R. Hoffmann,et al.  Assembly line balancing: a set of challenging problems , 1990 .

[3]  Ihsan Sabuncuoglu,et al.  Assembly line balancing using genetic algorithms , 2000, J. Intell. Manuf..

[4]  Armin Scholl,et al.  Balancing assembly lines effectively - A computational comparison , 1999, Eur. J. Oper. Res..

[5]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[6]  J. Wijngaard,et al.  The U-line balancing problem , 1994 .

[7]  John Miltenburg,et al.  The mixed-model U-line balancing problem , 1998 .

[8]  J. George Shanthikumar,et al.  Bounds and approximations for cycle times of a U-shaped production line , 1997, Oper. Res. Lett..

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[11]  Subhash C. Sarin,et al.  A survey of the assembly line balancing procedures , 1998 .

[12]  S. Sahu,et al.  Stochastic assembly line balancing using simulated annealing , 1994 .

[13]  Timothy L. Urban,et al.  Note. Optimal Balancing of U-Shaped Assembly Lines , 1998 .

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[15]  John Miltenburg,et al.  The effect of breakdowns on U-shaped production lines , 2000 .

[16]  Katsuhisa Ohno,et al.  Stochastic analysis of a U-shaped production line with multiple workers , 1997 .

[17]  John B. Kidd,et al.  Toyota Production System , 1993 .

[18]  John Miltenburg,et al.  Balancing U-lines in a multiple U-line facility , 1998, Eur. J. Oper. Res..

[19]  Katsuhisa Ohno,et al.  An optimal worker allocation problem for a U-shaped production line , 1999 .

[20]  Armin Scholl,et al.  ULINO: Optimally balancing U-shaped JIT assembly lines , 1999 .

[21]  E. H. Bowman.  Assembly-Line Balancing by Linear Programming , 1960 .

[22]  R. Kuik,et al.  Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic , 1990 .

[23]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[24]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .