Algorithms for sequencing mixed models on an assembly line in a JIT production system

In many mixed-model assembly lines in just-in-time (JIT) production systems, workers have the power and the responsibility to stop the conveyor whenever they fail to complete their operations within their work zones. Therefore, the conveyor stoppage in a sequencing problem should be taken into consideration. In this paper, two algorithms are proposed for finding an optimal or sub-optimal sequence of mixed models that minimizes the total conveyor stoppage time. The branch-and-bound method is devoted to find an optimal solution for small sized problems, while the simulated annealing method is used to cope with large scale problems to obtain a good sub-optimal solution. A numerical example of a 14 model problem shows that the simulated annealing algorithm is about 100 times faster than the branch-and-bound algorithm to find an optimal solution.

[1]  S. Sethi,et al.  A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems" , 1991 .

[2]  N. Draper,et al.  Applied Regression Analysis , 1966 .

[3]  Bernard W. Taylor,et al.  A COMPARATIVE ANALYSIS OF SEQUENCING PROCEDURES FOR MIXED-MODEL ASSEMBLY LINES IN A JUST-IN-TIME PRODUCTION SYSTEM , 1992 .

[4]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[5]  J. L. C. Macaskill,et al.  Computer Simulation for Mixed-Model Production Lines , 1973 .

[6]  Candace Arai Yano,et al.  Sequencing to minimize work overload in assembly lines with product options , 1991 .

[7]  W. Kubiak.  Minimizing variation of production rates in just-in-time systems: A survey☆ , 1993 .

[8]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[9]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[10]  Katsuhisa Ohno,et al.  A sequencing problem for a mixed-model assembly line in a JIT production system , 1994 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[13]  Kenjiro Okamura,et al.  A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor , 1979 .

[14]  R. R. Inman,et al.  Sequencing JIT mixed-model assembly lines , 1991 .

[15]  Nick T. Thomopoulos,et al.  Line Balancing-Sequencing for Mixed-Model Assembly , 1967 .

[16]  John Miltenburg,et al.  Scheduling mixed-model multi-level just-in-time production systems , 1989 .

[17]  Avraham Shtub,et al.  An analytic framework for sequencing mixed model assembly lines , 1992 .

[18]  G. Steiner,et al.  Level Schedules for Mixed-Model, Just-in-Time Processes , 1993 .

[19]  Em Dar-El,et al.  Optimal mixed-model sequencing for balanced assembly lines , 1977 .

[20]  Ezey M. Dar-El,et al.  Assembly line sequencing for model mix , 1975 .

[21]  Avraham Shtub,et al.  SEQUENCING MIXED-MODEL ASSEMBLY LINES TO LEVEL PARTS USAGE AND MINIMIZE LINE LENGTH , 1994 .