Structured buffer-allocation problems

Discrete Event Dynamic Systems: Theory and Applications

Volumn 6, Issue 1, 1996, Pages 9-41

  Glasserman, Paul ^a,b   Yao, David D ^b,c,d,e  

^a The Sanford C Bernstein Co Center for Leadership and Ethics   (United States)

^b Och Spine at New York Presbyterian Hospitals

^c Graduate School of Business ^*

^d IEEE

^e Center for Applied Probability ^*

Author keywords

Antimatroids; Finite buffer queues; Generalized semi Markov processes

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; RESOURCE ALLOCATION;

ANTIMATROIDS; FINITE BUFFER QUEUES; GENERAL BLOCKING; GENERALIZED SEMI MARKOV PROCESS (GSMP);

PRODUCTION CONTROL;

EID: 0029733944     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01796782     Document Type: Article

References (32)

1. Ammar, M. A., and Gershwin, S. B. 1989. Equivalence relations in queueing models of fork/join networks with blocking. Performance Evaluation 10: 233-245.
2. Anantharam, V., and Tsoucas, P. 1990. Stochastic concavity of throughput in series of queues with finite buffers. Advances in Applied Probability 22: 761-763.
3. Baccelli, F., Makowski, A., and Shwartz, A. 1989. The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Advances in Applied Probability 21: 629-660.
4. Buzacott, J. A. 1967. Automatic transfer lines with buffer stocks. Int. J. Prod. Res. 5: 183-200.
5. Buzacott, J. A. 1988. Kanban and MRP controlled production systems. Submitted for publication.
6. Buzacott, J. A., and Shanthikumar, J. G. 1992. Stochastic Models of Manufacturing Systems. Englewood Cliffs, NJ: Prentice-Hall.
7. Cheng, D. W. 1990. Tandem Queues with General Blocking: Stochastic Comparisons and Structural Properties, Ph.D. thesis, Columbia University.
8. Cheng, D. W. 1991a. Second-order properties of system throughput and system size of a tandem queue with general blocking. Submitted for publication.
9. Cheng, D. W. 1991b. Line reversibility of tandem queues with general blocking. Department of Statistics and Operations Research, New York University, New York, NY 10003.
10. Cheng, D. W., and Yao, D. D. 1993. Tandem queues with general blocking: a unified model and stochastic comparisons. Discrete Event Dynamic Systems: Theory and Applications 2: 207-234.
11. Conway, R., W. Maxwell, J. O. McClain, and L. J. Thomas. 1988. The role of work-in-process inventory in serial production lines. Operations Research 36: 229-241.
12. Dallery, Y. and D. Towsley. 1991. Symmetry property of the throughput in closed tandem queueing networks with finite buffers. Operations Research Letters 10: 541-547.
13. Gershwin, S. B. 1987. An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking. Operations Research 35: 291-305.
14. Glasserman, P. 1991. Structural conditions for perturbation analysis derivative estimation: finite-time performance indices. Operations Research 39: 724-738.
15. Glasserman, P., and D. D. Yao. 1992a. Monotonicity in generalized semi-Markov processes. Mathematics of Operations Research 17: 1-21.
16. Glasserman, P., and D. D. Yao. 1992b. Generalized semi-Markov processes: antimatroid structure and second-order properties. Mathematics of Operations Research 17: 444-469.
17. Glynn, P. W. 1989. A GSMP formalism for discrete-event systems. Proceedings of the IEEE 77: 14-23.
18. Ho, Y. C., Eyler, M. A., and Chien, T. T. 1979. A gradient technique for general buffer storage design in a production line. Int. J. Prod. Res. 17: 557-580.
19. Lim, J.-T., Meerchov, S. M., and Top, F. 1990. Homogeneous, asymptotically reliable serial production lines: theory and a case study. IEEE Trans. Automatic Control T-AC 35: 524-534.
20. Meester, L. E., and Shanthikumar, J. G. 1990. Concavity of the throughput of tandem queueing systems with finite buffer storage space. Advances in Applied Probability 22: 764-767.
21. Mitra, D., and Mitrani, I. 1990. Analysis of a novel discipline for cell coordination in production lines, I. Management Science 36: 1548-1566.
22. Muth, E. J. 1979, The reversibility property of production lines. Management Science 25: 152-158.
23. Rajan, R. and Agrawal, R. 1992. Structural properties of the throughput in cyclic networks with general blocking and starvation. Submitted to QUESTA.
24. Schassberger, R. 1978. Insensitivity of steady-state distributions of generalized semi-Markov processes. Part I. The Annals of Probability 5: 87-99.
25. Shanthikumar, J. G., and Yao, D. D. 1989. Monotonicity and concavity properties in cyclic queueing networks with finite buffers, in Queueing Networks with Blocking, H. Perros and T. Altiok (Eds.), Elsevier Science, 325-344.
26. Sparaggis, P. D., and Gong, W. B. 1990. A GSMP model for the buffer allocation problem in cyclic networks. Proceedings of the 29th IEEE Conference on Decision and Control, Honolulu, Hawaii, 903-908.
27. Tayur, S. R. 1990. Structural properties of a Kanban controlled serial manufacturing system. Technical Report #934, School of OR/IE, Cornell University, Ithaca, NY 14853.
28. Tayur, S. R. 1991. Kanbans, generalized semi-Markov processes and anti-matroids, Technical Report #954, School of OR/IE, Cornell University, Ithaca, NY 14853.
29. Tsoucas, P., and Walrand, J. 1989. Monotonicity of throughput in non-Markovian networks. Journal of Applied Probability 26: 134-141.
30. Whitt, W. 1980. Continuity of generalized semi-Markov processes. Mathematics of Operations Research 5: 494-501.
31. Yamazaki, G., and Sakasegawa, H. 1975. Properties of duality in tandem queueing systems. Ann. Inst. Stat. Math. 21: 201-212.
32. Zipkin, P. 1989. A Kanban-like production controlled system: analysis of simple models. Working Paper, Columbia University Graduate School of Business.