A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line

Abstract This paper presents a Simulated Annealing based heuristic that simultaneously considers both setups and the stability of parts usage rates when sequencing jobs for production in a just-in-time environment. Varying the emphasis of these two conflicting objectives is explored. Several test problems are solved via the Simulated Annealing heuristic, and their objective function values are compared to solutions obtained via a Tabu Search approach from the literature. Comparison shows that the Simulated Annealing approach provides superior results to the Tabu Search approach. It is also found that the Simulated Annealing approach provides near-optimal solutions for smaller problems.

[1]  Ahmet Bolat,et al.  Sequencing jobs on an automobile assembly line: objectives and procedures , 1994 .

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

[3]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

[5]  Suresh K. Nair,et al.  Near optimal solutions for product line design and selection: beam search heuristics , 1995 .

[6]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

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

[8]  George Steiner,et al.  A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems , 1990 .

[9]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[10]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[11]  E A Duplaga,et al.  Mixed-model assembly line sequencing heuristics for smoothing component parts usage: A comparative analysis , 1998 .

[12]  Prabuddha De,et al.  Heuristic Estimation of the Efficient Frontier for a Bi‐Criteria Scheduling Problem , 1992 .

[13]  Hong Long,et al.  A sequencing problem to level part usage rates and work loads for a mixed-model assembly line with a bypass subline , 1999 .

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

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[17]  Candace Arai Yano,et al.  Survey, development, and applications of algorithms for sequencing paced assembly lines , 1989 .

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

[19]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[20]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[21]  Mullen,et al.  JIT sequencing for mixed-model assembly lines with setups using Tabu Search , 1998 .

[22]  Robert T. Sumichrast,et al.  Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems , 1990 .