Annals of Operations Research

, Volume 93, Issue 1–4, pp 117–144 | Cite as

Efficient algorithms for buffer space allocation

  • Stanley B. Gershwin
  • James E. Schor


This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the primal problem is solved using the dual solution. Numerical results are presented. Profit optimization problems are natural generalizations of the primal and dual problems, and we show how they can be solved using essentially the same algorithms.


Production Rate Gradient Method Efficient Algorithm Dual Problem Flow Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    I. Adan and J. van der Wal, Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes, in: Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science, 1989) pp. 345–356.Google Scholar
  2. [2]
    T. Altiok and S. Stidham Jr., The allocation of interstage buffer capacities in production lines, IIE Transactions 15 (1983) 292–299.Google Scholar
  3. [3]
    V. Anantharam and P. Tsoucas, Stochastic concavity of throughput in series of queues with finite buffers, Advances in Applied Probability 22 (1990) 761–763.Google Scholar
  4. [4]
    D.R. Anderson and C.L. Moodie, Optimal buffer storage capacity in production line systems, In-ternational Journal of Production Research 7(3) (1969) 233–240.Google Scholar
  5. [5]
    K. Barten, A queueing simulator for determining optimum inventory levels in a sequential process, Journal of Industrial Engineering 13(4) (1962) 245–252.Google Scholar
  6. [6]
    M. Burman (1995), New results in flow line analysis, Ph.D. thesis, MIT, Cambridge MA (1995).Google Scholar
  7. [7]
    J.A. Buzacott, Automatic transfer lines with buffer stocks, International Journal of Production Research 5(3) (1967) 182–200.Google Scholar
  8. [8]
    J.A. Buzacott, Prediction of the efficiency of production systems without internal storage, Interna-tional Journal of Production Research 6(3) (1968) 173–188.Google Scholar
  9. [9]
    J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems (Prentice-Hall, 1993).Google Scholar
  10. [10]
    M. Caramanis, Production system design: A discrete event dynamic system and generalized Ben-ders' decomposition approach, International Journal of Production Research 25(8) (1987) 1223–1234.Google Scholar
  11. [11]
    We-Min Chow, Buffer capacity analysis for sequential production lines with variable processing times, International Journal of Production Research 25(8) (1987) 1183–1196.Google Scholar
  12. [12]
    Y. Dallery, R. David and X.L. Xie, An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers, IIE Transactions 20(3) (1988) 280–283.Google Scholar
  13. [13]
    Y. Dallery and S.B. Gershwin, Manufacturing flow line systems: A review of models and analytical results, Queueing Systems 12(1–2) (1992) 3–94.Google Scholar
  14. [14]
    Y. Dallery, Z. Liu and D. Towsley, Equivalence, reversibility, symmetry and concavity properties in fork/join queueing networks with blocking, Journal of the ACM 41(5) (1994) 903–942.Google Scholar
  15. [15]
    E. Dogan and T. Altiok, Gradient estimation of the output rate in transfer lines, Preprint, Rutgers University, Dept. of Industrial Engineering.Google Scholar
  16. [16]
    M.C. Freeman, The effects of breakdowns and interstage storage on production line capacity, Journal of Industrial Engineering 15(4) (1964) 194–200.Google Scholar
  17. [17]
    S.B. Gershwin, An efficient decomposition algorithm for the approximate evaluation of tandem queues with finite storage space and blocking, Operations Research 35 (1987) 291–305.Google Scholar
  18. [18]
    S.B. Gershwin, Manufacturing Systems Engineering (Prentice-Hall, 1994).Google Scholar
  19. [19]
    S.B. Gershwin, Design and operation of manufacturing systems-control-and system-theoretical models and issue, in: 1997 American Control Conference, Albuquerque, New Mexico (June 4–6, 1997).Google Scholar
  20. [20]
    S.B. Gershwin and Y. Goldis, Efficient algorithms for transfer line design, MIT Laboratory for Manufacturing and Productivity Report LMP–95–005 (1995).Google Scholar
  21. [21]
    S.B. Gershwin and I.C. Schick, Continuous model of an unreliable material flow systems with a finite interstage buffer, MIT LIDS Report LIDS-R-1039 (1980).Google Scholar
  22. [22]
    P. Glasserman and D.D. Yao, Structured buffer-allocation problems, Journal of Discrete Event Dynamic Systems 6 (1996) 9–42.Google Scholar
  23. [23]
    J.M. Hatcher, The effect of internal storage on the production rate of a series of stages having exponential service times, AIIE Transactions 1(2) (1969) 150–156.Google Scholar
  24. [24]
    F.S. Hillier and K.C. So, The effect of machine breakdowns and interstage storage on the per-formance of production line systems, International Journal of Production Research 29(10) (1991) 2043–2055.Google Scholar
  25. [25]
    F.S. Hillier, K.C. So and R.W. Boling, Toward characterizing the optimal allocation of storage space in production line systems with variable processing times, Management Science 39(1) (1993). 126–133.Google Scholar
  26. [26]
    Y.C. Ho, M.A. Eyler and T.T. Chien, A gradient technique for general buffer storage design in a production line, International Journal of Production Research 17(6) (1979) 557–580.Google Scholar
  27. [27]
    Y.C. Ho, M.A. Eyler and T.T. Chien, A new approach to determine parameter sensitivities of transfer lines, Management Science 29(6) (1983) 700–714.Google Scholar
  28. [28]
    D. Jacobs and S.M. Meerkov, A system-theoretic property of serial production lines: Improvability, The University of Michigan College of Engineering Control Group Reports, Report No. CGR–93–1 (1993).Google Scholar
  29. [29]
    D. Jacobs and S.M. Meerkov, System-theoretic properties of the process of continuous improvement in production systems, in: Proceedings of the American Control Conference, Baltimore, Maryland (1994) pp. 3323–3327.Google Scholar
  30. [30]
    M.A. Jafari and J.G. Shanthikumar, Determination of optimal buffer storage capacities and optimal allocation in multistage automatic transfer lines, IIE Transactions 21(2) (1989) 130–134.Google Scholar
  31. [31]
    A.D. Knott, Letter, AIIE Transactions 2(3) (1970) p. 273.Google Scholar
  32. [32]
    S.A. Kraemer and R.F. Love, A model for optimizing the buffer inventory storage size in a sequential production system, AIIE Transactions II(1) (1970) 64–69.Google Scholar
  33. [33]
    C.-T. Kuo, J.-T. Lim and S.M. Meerkov, Improvability analysis of a machining transfer line: An application, The University of Michigan College of Engineering Control Group Reports, Report No. CGR–94–08 (1994).Google Scholar
  34. [34]
    C.-M. Liu and C.-L. Lin, Performance evaluation of unbalanced serial production lines, International Journal of Production Research 32(12) (1994) 2897–2914.Google Scholar
  35. [35]
    G.E. Martin, Predictive formulae for unpaced line efficiency, International Journal of Production Research 31(8) (1993) 1981–1990.Google Scholar
  36. [36]
    G.E. Martin, Optimal design of production lines,International Journal of Production Research 32(5) (1994) 989–1000.Google Scholar
  37. [37]
    L.E. Meester and J.G. Shanthikumar, Concavity of the throughput of tandem queueing systems with finite buffer storage space, Advances in Applied Probability 22 (1990) 764–767.Google Scholar
  38. [38]
    J.A. Muckstadt and S.R. Tayur, A comparison of alternative kanban control mechanisms. I. Back-ground and structural results, IIE Transactions 27 (1995) 140–150.Google Scholar
  39. [39]
    J.A. Muckstadt and S.R. Tayur, A comparison of alternative kanban control mechanisms. II. Exper-imental results, IIE Transactions 27 (1995) 151–161.Google Scholar
  40. [40]
    T. Park, A two-phase heuristic algorithm for determining buffer sizes of production lines, Interna-tional Journal of Production Research 31(3) (1993) 613–631.Google Scholar
  41. [41]
    E.L. Plambeck, B.-R. Fu, S.M. Robinson and R. Suri, Throughput optimization in tandem pro-duction lines via nonsmooth programming, Proceedings of the 1993 Summer Computer Simulation Conference, Boston (1993).Google Scholar
  42. [42]
    S.G. Powell, Buffer allocation in unbalanced three-station serial lines, International Journal of Production Research 32(9) (1994) 2201–2218.Google Scholar
  43. [43]
    S.G. Powell and D.F. Pyke, Optimal allocation of buffers in serial production lines with a single bottleneck, The Amos Tuck School of Business Administration, Dartmouth College, Working Paper No. 301 (1994).Google Scholar
  44. [44]
    J.E. Schor, Efficient algorithms for buffer allocation, M.S. thesis, MIT, Cambridge, MA (1995).Google Scholar
  45. [45]
    D. Seong, S.Y. Chang and Y. Hong, Heuristic algorithms for buffer allocation in a production line with unreliable machines, Department of Industrial Engineering, POSTECH, Korea; International Journal of Production Research (1994) (accepted for publication).Google Scholar
  46. [46]
    D. Seong, S.Y. Chang and Y. Hong, An algorithm for buffer allocation with linear resource con-straints in a continuous flow production line, Technical Report IE-TR–94–05, Department of Indus-trial Engineering, POSTECH, Korea (1994).Google Scholar
  47. [47]
    B.A. Sevast'yanov, Influence of storage bin capacity on the average standstill time of a production line, Teoriya Veroyatnostey i ee Primeneniya 7(4) 438–447 (in Russian). (English translation: Theory.144 S.B. Gershwin, J.E. Schor / Efficient algorithms for buffer space allocation of Probability and its Applications 7(4) (1962) 429–438.)Google Scholar
  48. [48]
    J.G. Shanthikumar and D.D. Yao, Monotonicity and concavity properties in cyclic queueing networks with finite buffers, in: Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science, 1989) pp. 325–344.Google Scholar
  49. [49]
    T.J. Sheskin, Allocation of interstage storage along an automatic production line, AIIE Transactions 8(1) (1976) 146–152.Google Scholar
  50. [50]
    J. MacGregor Smith and S. Daskalaki, Buffer space allocation in automated assembly lines, Oper-ations Research 36(2) (1988) 343–357.Google Scholar
  51. [51]
    A.L. Soyster, J.W. Schmidt and M.W. Rohrer, Allocation of buffer capacities for a class of fixed cycle production lines, AIIE Transactions 11(2) (1979) 140–146.Google Scholar
  52. [52]
    S.R. Tayur, Properties of serial kanban systems, Queueing Systems 12 (1992) 297–318.Google Scholar
  53. [53]
    H. Yamashita and T. Altiok, Buffer capacity allocation for a desired throughput in production lines, Presented at the Workshop on Performance Evaluation and Optimization of Production Lines,Inter-national Workshop held on May 19–21, 1997, on Samos Island, in the Department of Mathematics, University of the Aegean, GR-832 00 Karlovassi, Samos Island, Greece.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Stanley B. Gershwin
    • 1
  • James E. Schor
    • 2
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.Analytics, Inc.CambridgeUSA

Personalised recommendations