A simulated annealing approach for buffer allocation in reliable production lines

We describe a simulated annealing approach for solving the buffer allocation problem in reliable production lines. The problem entails the determination of near optimal buffer allocation plans in large production lines with the objective of maximizing their average throughput. The latter is calculated utilizing a decomposition method. The allocation plan is calculated subject to a given amount of total buffer slots in a computationally efficient way.

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

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[3]  M. D. MacLaren.  The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth) , 1970 .

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

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

[6]  Harry G. Perros,et al.  Queueing networks with blocking: a bibliography , 1984, PERV.

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

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

[9]  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..

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

[11]  William L. Maxwell,et al.  The Role of Work-in-Process Inventory in Serial Production Lines , 1988, Oper. Res..

[12]  L. Ingber.  Very fast simulated re-annealing , 1989 .

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

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

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

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

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

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

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

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

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

[22]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

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

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

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

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

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

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

[29]  SO KUTC..  Optimal buffer allocation strategy for minimizing work-in- process inventory in unpaced production lines , 1997 .

[30]  H. T. Papadopoulos,et al.  A model management system (MMS) for the design and operation of production lines , 1997 .

[31]  Thomas de Quincey.  [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.

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

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