Stochastic Algorithms for Buffer Allocation in Reliable Production Lines

The allocation of buffers between workstations is a major optimization problem faced by manufacturing systems designers. It entails the determination of optimal buffer allocation plans in production lines with the objective of maximizing their throughput. We present and compare two stochastic approaches for solving the buffer allocation problem in large reliable production lines. The allocation plan is calculated subject to a given amount of total buffer slots using simulated annealing and genetic algorithms. The throughput is calculated utilizing a decomposition method.

[1]  Yves Dallery,et al.  Manufacturing flow line systems: a review of models and analytical results , 1992, Queueing Syst. Theory Appl..

[2]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[3]  H. T. Papadopoulos,et al.  Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines , 1996 .

[4]  Charles L. Karr,et al.  Genetic algorithms for modelling, design, and process control , 1993, CIKM '93.

[5]  Diomidis Spinellis,et al.  EXPLORE: A MODULAR ARCHITECTURE FOR PRODUCTION LINE OPTIMISATION , 1999 .

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

[7]  Tayfur Altiok,et al.  Performance analysis of manufacturing systems , 1996 .

[8]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[9]  Diomidis Spinellis,et al.  A simulated annealing approach for buffer allocation in reliable production lines , 2000, Ann. Oper. Res..

[10]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[11]  Christos Koulamas,et al.  A survey of simulated annealing applications to operations research problems , 1994 .

[12]  Rajiv Gupta,et al.  On randomization in sequential and distributed algorithms , 1994, CSUR.

[13]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[14]  Kelvin C. W. So,et al.  The effect of the coefficient of variation of operation times on the allocation of storage space in , 1991 .

[15]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[16]  Frederick S. Hillier,et al.  Toward characterizing the optimal allocation of storage space in production line systems with variable processing times , 1993 .

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

[18]  Yves Dallery,et al.  On Decomposition Methods for Tandem Queueing Networks with Blocking , 1993, Oper. Res..

[19]  Farhad Azadivar,et al.  Genetic algorithms in optimizing simulated systems , 1995, WSC '95.

[20]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[22]  Larry Wall,et al.  Programming Perl , 1991 .

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

[24]  David E. Goldberg,et al.  Genetic and evolutionary algorithms come of age , 1994, CACM.

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

[26]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[27]  Stanley B. Gershwin,et al.  Efficient algorithms for buffer space allocation , 2000, Ann. Oper. Res..

[28]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[29]  Akif Asil Bulgak,et al.  Buffer size optimization in asynchronous assembly systems using genetic algorithms , 1995 .

[30]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[31]  Ben Atkinson,et al.  Queueing theory in manufacturing systems analysis and design , 1993 .

[32]  Stanley B. Gershwin,et al.  An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking , 1987, Oper. Res..

[33]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[34]  William H. Press,et al.  Numerical recipes in C , 2002 .