Performance evaluation of production networks

Handbooks in Operations Research and Management Science

Volumn 4, Issue C, 1993, Pages 199-286

  Suri, Rajan ^a   Sanders, Jerry L ^a   Kamath, Manjunath ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957033398     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80185-9     Document Type: Review

References (305)

1. Adan, I., Van der Wal, J., Monotonicity of the throughput of a closed queueing network in the number of jobs. Oper. Res. 37:6 (1989), 953–957.
2. Agrawal, S.C., Metamodeling: A study of approximations in queueing models. Research Reports and Notes, Computer Systems Series, 1985, MIT Press, Washington, DC.
3. Akyildiz, I.F., Exact analysis of queueing networks with rejection blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Cambridge, MA, 19–32.
4. Albin, S.L., Poisson approximations for superposition arrival processes in queues. Management Sci. 28:2 (1982), 126–137.
5. Altiok, T., Approximate analysis of exponential tandem queues with blocking. European J. Oper. Res. 11 (1982), 390–398.
6. Altiok, T., Stidham, S. Jr, A note on transfer lines with unreliable machines, random processing times, and finite buffers. IIE Trans. 12:2 (1982), 125–127.
7. Altiok, T., Stidham, S. Jr, The allocation of interstage buffer capacities in production lines. IIE Trans. 15:4 (1983), 292–299.
8. Alvarez, R., Dallery, Y., David, R., An experimental study of the continuous flow model of transfer lines with unreliable machines and finite buffers. IMACS-IFAC Symposium: Modeling and Control of Technological Systems 91, Lille, France, 1991.
9. Ammar, M.H., Modelling and analysis of unreliable manufacturing assembly networks with finite storage. MIT Laboratory for Information and Decision Sciences, Report LIDS-TH-1004, 1980.
10. Anderson, K.R., A method for planning analysis and design simulation of CIM systems. Proc. 1987 Winter Simulation Conf., 1987, IEEE Computer Society Press, Amsterdam, 715–720.
11. Anderson, K.R., Diehl, G.W., Shimizu, M., Suri, R., Integrating spreadsheets, system modeling, and animation for rapid computer-aided design of manufacturing systems. Proc. 1988 University Programs in Computer-Aided Engineering, Design and Manufacturing (UPCAEDM) Conf., 1988.
12. Ashcroft, H., The productivity of several machines under the care of one operator. J. Roy. Statist. Soc. B 12:9 (1950), 145–151.
13. Balbo, G., Bruel, S.C., Ghanta, S., Combining queueing network and generalized stochastic Petri net models for the analysis of some software blocking phenomena. IEEE Trans. Software Engrg. 12:4 (1986), 561–576.
14. Balbo, G., Chiola, G., Franceschinis, G., Stochastic Petri net simulation for the evaluation of flexible manufacturing systems. Proc. 1989 European Simulation Multiconference, 1989, 5–12.
15. Balsamo, S., Iazeolla, G., An extension of Norton's theorem for queueing networks. IEEE Trans. Software Engrg. 8:4 (1982), 298–305.
16. Barbour, A.D., Networks of queues and the method of stages. Adv. Appl. Probl. 8 (1976), 584–591.
17. Bard, Y., Some extensions to multiclass queueing network analysis. Arato, M., (eds.) Performance of Computer Systems, 1979, North-Holland, Amsterdam.
18. Barlow, R.E., Proschan, F., Statistical theory of Reliability and Life Testing: Probability Models. 1975, Holt, Reinhart, and Winston, Amsterdam.
19. Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G., Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22:2 (1975), 248–260.
20. Benson, F., Cox, D.R., The productivity of machines requiring attention at random intervals. J. Roy. Statist. Soc. B 13:1 (1951), 65–82.
21. Waltham, MA BGS Systems, Inc., BEST/I User's Guide. 1982.
22. Bhat, U.N., Elements of Applied Stochastic Processes. 1972, Wiley, New York.
23. Bitran, G.R., Tirupati, D., Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference. Management Sci. 34:1 (1988), 75–100.
24. Bitran, G.R., Tirupati, D., Approximations for networks of queues with overtime. Management Sci. 37:3 (1991), 282–300.
25. Boxma, O.J., Kelly, F.P., Konheim, A.G., The product form of the sojourn time distributions in cyclic exponential queues. J. ACM 31:1 (1984), 128–133.
26. Boxma, O.J., Konheim, A.G., Approximate analysis of exponential queueing systems with blocking. Acta Inform. 15 (1981), 19–66.
27. Brandwajn, A.E., A model of a time-sharing virtual memory system solved using equivalence and decomposition methods. Acta Inform. 4:1 (1974), 11–47.
28. Brandwajn, A.E., Fast approximate solution of multiprogramming models. Proc. 1982 ACM SIGMETRCS Conf. on Measurement and Modeling of Computer Systems, Seattle, August 1982 Performance Evaluation Rev., 11, 1982, 141–149 4.
29. Brandwajn, A., Jow, Y.L., An approximation method for tandem queues with blocking. Oper. Res. 36:1 (1988), 73–83.
30. Brown, E., IBM combines rapid modeling technique and simulation to design PCB factory-of-the-future. Ind. Eng. 20:6 (1988), 23–26.
31. Bruell, S.C., Balbo, G., Computational Algorithms for Closed Queueing Networks. 1980, Elsevier, New York.
32. Brumfield, J.A., Operational analysis of queueing phenomenon. Ph.D. Thesis, 1982, Dept. of Computer Sciences, Purdue University, New York.
33. Bulgak, A.A., Kamath, M., Sanders, J.L., Research on the dynamics and design optimization of automatic assembly systems. Proc. 15th Conf. on Production Research and Technology, SME, 1989, 275–283.
34. Bunday, B.D., Scraton, R.E., The G/M/r machine interference model. European J. Oper. Res. 4 (1980), 399–402.
35. Burke, P.J., The output of a queueing system. Oper. Res. 4 (1956), 699–704.
36. Buzacott, J.A., Automatic transfer lines with buffer stocks. Internat. J. Prod. Res. 5:3 (1967), 183–200.
37. Buzacott, J.A., The effect of station breakdowns and random processing times on the capacity of flow lines with in-process storage. AIIE Trans. 4:4 (1972), 308–312.
38. Buzacott, J.A., ‘Optimal’ operating rules for automated manufacturing systems. IEEE Trans. Automat. Control, 1982, 80–86.
39. Buzacott, J.A., Queueing models of Kanban and MRP controlled production systems. Engrg. Costs Prod. Econom. 17 (1989), 3–20.
40. Buzacott, J.A., Abandoning the moving assembly line: Models of human operators and job sequencing. Internat. J. Prod. Res. 28:5 (1990), 821–839.
41. Buzacott, J.A., Hanifin, L.E., Models of automatic transfer lines with inventory banks — A review and comparison. AIIE Trans. 10:2 (1978), 197–207.
42. Buzacott, J.A., Kostelski, D., Matrix-geometric and recursive algorithm solution of a two-stage unreliable flow line. IIE Trans. 19:4 (1987), 429–438.
43. Buzacott, J.A., Shanthikumar, J.G., Models for understanding flexible manufacturing systems. AIIE Trans. 12 (1980), 339–350.
44. Buzacott, J.A., Shanthikumar, J.G., On approximate queueing models of dynamic job shops. Management Sci. 31:7 (1985), 870–887.
45. Buzacott, J.A., Shanthikumar, J.G., A general approach for coordinating production in multiple-cell manufacturing systems. Prod. Oper. Management 1:1 (1992), 34–52.
46. Buzacott, J.A., Shanthikumar, J.G., Stochastic Models of Manufacturing Systems. 1992, Prentice-Hall, West Lafayette.
47. Buzacott, J.A., Yao, D.D., Flexible manufacturing systems: A review of analytical models. Management Sci. 32:7 (1986), 890–905.
48. Buzen, J.P., Computational algorithms for closed queueing networks with exponential servers. Commun. ACM 16:9 (1973), 527–531.
49. Buzen, J.P., Operational analysis: The key to the new generation of performance prediction tools. COMPCON Fall 1976, Washington, DC, 1976, 166–171.
50. Calabrese, J.M., Hausman, W.H., Simultaneous determination of lot sizes and routing mix in job shops. Management Sci. 37:8 (1991), 1043–1057.
51. Cavaille, J.B., Dubois, D., Heuristic methods based on mean value analysis for flexible manufacturing systems performance evaluation. Proc. 21st IEEE Conf. on Decision and Control, Orlando, Florida, 1982, 1061–1065.
52. Chandy, K.M., Herzog, U., Woo, L., Parametric analysis of queueing networks. IBM J. Res. Develop. 19:1 (1975), 36–42.
53. Chandy, K.M., Herzog, U., Woo, L., Approximate analysis of general queueing networks. IBM J. Res. Develop. 19:1 (1975), 43–49.
54. Chandy, K.M., Neuse, D., Linearizer: A heuristic algorithm for queueing network models of computing systems. Commun. ACM 25:2 (1982), 126–134.
55. Chandy, K.M., Sauer, C.H., Computational algorithms for product form queueing networks. Commun. ACM 23:10 (1980), 573–583.
56. Chen, H., Harrison, J.M., Mandelbaum, A., Van Ackere, A., Wein, L.M., Empirical evaluation of a queueing network model for semiconductor wafer fabrication. Oper. Res. 36 (1988), 202–215.
57. Choobineh, F., Suri, R., (eds.) Flexible Manufacturing Systems: Current Issues and Models, 1986, Industrial Engineering & Management Press, Englewood Cliffs, NJ.
58. Choong, Y.F., Gershwin, S.B., A decomposition method for the approximate evaluation of capacitated transfer lines with unreliable machines and random processing times. IIE Trans. 19:2 (1987), 150–159.
59. Clark, C.D., The greatest of a finite set of random variables. Oper. Res. 9:2 (1961), 145–162.
60. Cohen, G., Dubois, D., Quadrat, J.P., Viot, M., A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Trans. Automat. Control 30 (1985), 210–220.
61. Conway, A.E., Georganas, N.D., RECAL — A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. J. Assoc. Comput. Mach. 33:4 (1986), 768–791.
62. Courtois, P.J., Decomposability: Queueing and Computer System Applications. 1977, Academic Press, Atlanta, GA.
63. Dallery, Y., David, R., Xie, X.L., An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers. IIE Trans. 20:3 (1988), 280–283.
64. Dallery, Y., David, R., Xie, X.L., Approximate analysis of transfer lines with unreliable machines and finite buffers. IEEE Trans. Automat. Control 34:9 (1989), 943–953.
65. Dallery, Y., Frein, Y., An efficient method to determine the optimal configuration of a flexible manufacturing system. Proc. 2nd ORSA/TIMS Conf. on Flexible Manufacturing Systems, Ann Arbor, MI, 1986, 269–282.
66. Dallery, Y., Frein, Y., A decomposition method for the approximate analysis of closed queueing networks with blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, New York, 19–32.
67. Daskalaki, S., Smith, J.M., Real-time routing in finite queueing networks. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Amsterdam, 313–324.
68. Deleersnyder, J.-L., Hodgson, T.J., Muller, H., O'Grady, P.J., Kanban controlled pull systems: An analytical approach. Management Sci. 35:9 (1989), 1079–1091.
69. Denning, P.J., Buzen, J.P., The operational analysis of queueing network models. ACM Comput. Surveys 10:3 (1978), 225–261.
70. Dertouzos, M.L., Lester, R.K., Solow, R.M., the MIT Commission on Industrial Productivity, Made in America: Regaining the Productive Edge. 1989, MIT Press, Amsterdam.
71. De Souza e Silva, E., Lavenberg, S.S., Calculating joint queue-length distributions in product-form queueing networks. J. Assoc. Comput. Mach. 36:1 (1989), 194–207.
72. De Souza e Silva, E., Muntz, R.R., Approximate solutions for a class of nonproduct form queueing networks. Performance Evaluation 7 (1987), 221–242.
73. Desruelle, P., Gujar, R., Hammer, R., Design of a circuit board manufacturing module using a consistent sequence of PC-based analysis tools. Proc. Manufacturing Intl. ‘90 Conf., 1990, ASME Press, London.
74. DeTreville, S., FMS: Finnish manufacturing systems. Manuf. Syst. 9 (1991), 14–17.
75. Dietrich, B.L., March, B.M., An application of a hybrid approach to modeling a flexible manufacturing system. Ann. Oper. Res. 3 (1985), 263–276.
76. Di Mascolo, M., Frein, Y., Dallery, Y., David, R., Modeling of Kanban systems using Petri nets. Proc. Third ORSA/TIMS Conf. Flexible Manufacturing Syst., 1989, Elsevier, Amsterdam, 307–312.
77. Disney, R., Koenig, D., Queueing networks: A survey of their random processes. SIAM Rev. 27 (1985), 335–403.
78. Eager, D.L., Sevcik, K.C., Performance bound hierarchies for queueing networks. ACM Trans. Comp. Syst. 1:2 (1983), 99–115.
79. Emerson, H.P., Naehring, D.C.E., Origins of Industrial Engineering: The Early Years of Profession. 1988, Industrial Engineering & Management Press, Amsterdam.
80. Ferdinand, A.E., A statistical mechanical approach to systems analysis. IBM J. Res. Develop. 14 (1970), 539–547.
81. Flatto, L., Hahn, S., Two parallel queues created by arrivals with two demands. I. SIAM J. Appl. Math. 44:5 (1984), 1041–1053.
82. Fleming, P.J., Simon, B., Interpolation approximations of sojourn time distributions. Oper. Res. 39:2 (1991), 251–260.
83. Foster, F.G., Perros, H.G., On the blocking process in queue networks. European J. Oper. Res. 5 (1980), 276–283.
84. Fu, B.R., Falkner, C., Suri, R., Garlid, S., Combining economic analysis and system modeling to evaluate test strategies for circuit board assembly lines. Edosomwan, J.A., Ballakur, A., (eds.) Productivity and Quality Improvement in Electronics Assembly, 1988, Industrial Engineering & Management Press, Atlanta, GA, 479–506.
85. Gelenbe, E., Pujolle, G., Introduction to Queueing Networks. 1987, Wiley, Atlanta, GA.
86. Gershwin, S.B., An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking. Oper. Res. 35:2 (1987), 291–305.
87. Gershwin, S.B., Representation and analysis of transfer lines with machines that have different processing rates. Ann. Oper. Res. 9 (1987), 511–530.
88. Gershwin, S.B., Assembly/disassembly systems: An efficient decomposition algorithm for tree-structured networks. IIE Trans. 23:4 (1991), 302–314.
89. Gershwin, S.B., Berman, O., Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers. AIIE Trans. 13:1 (1981), 2–11.
90. Gershwin, S.B., Hildebrant, R.R., Mitter, S.K., Suri, R., A control perspective on recent trends in manufacturing systems. IEEE Control Syst. Mag. 6 (1986), 3–15.
91. Gershwin, S.B., Schick, I.C., Modeling and analysis of three-stage transfer lines with unreliable machines and finite buffers. Oper. Res. 31 (1983), 354–380.
92. Glasserman, P., Yao, D.D., Algebraic structure of some stochastic discrete event systems, with applications. Discrete Event Dynamic Systems: Theory and Applications 1 (1991), 7–35.
93. Glasserman, P., Yao, D.D., Monotonicity in generalized semi Markov processes. Math. Oper. Res. 17:1 (1992), 1–21.
94. Glasserman, P., Yao, D.D., Generalized semi-Markov processes: Antimatroid structure and second-order properties. Math. Oper. Res. 17:2 (1992), 444–469.
95. Glassey, C.R., Resende, M.G.C., Closed-loop release control for VLSI circuit manufacturing. IEEE Trans. Semiconductor Manuf. 1 (1988), 36–46.
96. Glynn, P.W., Likelihood ratio derivative estimators for stochastic systems. Proc. 1989 Winter Simulation Conf., 1989, IEEE Computer Society Press, New York, 374–380.
97. Glynn, P.W., Whitt, W., A new view of the heavy-traffic limit theorem for infinite-server queues. Adv. in Appl. Probab. 23:1 (1991), 188–209.
98. Gordon, K.D., Dowdy, L.W., The impact of certain parameter estimation errors in queueing network models. Proc. Performance ‘80, Toronto, Canada, Performance Evaluation Rev., 9, 1980, 3–9 2.
99. Gordon, W.J., Newell, G.F., Closed queueing systems with exponential servers. Oper. Res. 15 (1967), 254–265.
100. Gordon, W.J., Newell, G.F., Cyclic queueing systems with restricted length queues. Oper. Res. 15 (1967), 266–277.
101. Graves, S.C., A review of production scheduling. Oper. Res. 29:4 (1981), 646–675.
102. Groenevelt, H., Karmarkar, U.S., A dynamic Kanban system case study. Prod. Invent. Management J. 29 (1988), 46–50.
103. Gross, D., Harris, C.M., Fundamentals of Queueing Theory. 1985, Wiley, New York.
104. Harper, R., O'Loughlin, M.J., Manufacturing process analysis — Tools and applications. Proceedings of the 1987 Winter Simulation Conference, 1987, IEEE Computer Society Press, New York, 731–737.
105. Harrison, J.M., Assembly like queues. J. Appl. Probab. 10 (1973), 354–367.
106. Harrison, J., Nguyen, V., The QNET method for two-moment analysis of open queueing networks. Queueing Syst. 6 (1990), 1–32.
107. Hax, A.C., Meal, H.C., Hierarchical integration of production planning and scheduling. Geisler, M.A., (eds.) Logistics, 1975, North-Holland, Amsterdam.
108. Hayes, R.H., Wheelwright, S.C., Clark, K.B., Dynamic Manufacturing: Creating the Learning Organization. 1988, The Free Press, Amsterdam.
109. Heyman, P., Sobel, M.J., Stochastic Models in Operations Research. 1982, McGraw-Hill, New York.
110. Hillier, F.S., Boling, R.W., Finite queues in series with exponential or Erlang service times — A numerical approach. Oper. Res. 15 (1967), 286–303.
111. Ho, Y.C., Performance evaluation and perturbation analysis of discrete event dynamic systems. IEEE Trans. Automat. Control 32 (1987), 563–572.
112. Holliday, M.A., Vernon, M.K., A generalized timed Petri net model for performance analysis. IEEE Trans. Software Engrg. 13 (1987), 1297–1310.
113. Hopp, W.J., Simon, J.T., Bounds and heuristics for assembly-like queues. Queueing Syst. 4 (1989), 137–156.
114. Hoyme, K.P., Bruell, S.C., Afshari, P.V., Kain, R.Y., A tree-structured MVA algorithm. Tech. Report 82-17, 1982, Computer Science Department, University of Minnesota, New York.
115. Inan, K.M., Varaiya, P.P., Algebras of discrete event models. Proc. IEEE, 77, 1989, 24–38.
116. Jackson, J.R., Jobshop-like queueing systems. Management Sci. 10 (1963), 131–142.
117. Jacobson, P.A., Lazowska, E.D., Analyzing queueing networks with simultaneous resource possession. Commun. ACM 25:2 (1982), 142–151.
118. Jun, K.P., Perros, H.G., Approximate analysis of arbitrary configurations of queueing networks with blocking and deadlock. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Minneapolis, MN, 259–279.
119. Kamath, M., Analytical performance models for automatic assembly systems. Ph.D. Thesis, 1989, Dept. of Industrial Engineering, University of Wisconsin-Madison, Amsterdam.
120. Kamath, M., Sanders, J.L., Analysis of asynchronous automatic assembly systems with bottleneck stations. SYSTEMS I Conf. Papers, 1986, SME, Chicago, IL.
121. Kamath, M., Sanders, J.L., Analytical methods for performance evaluation of large asynchronous automatic assembly systems. Large Scale Syst. 12:2 (1987), 143–154.
122. Kamath, M., Sanders, J.L., Modeling operator/workstation interference in asynchronous automatic assembly systems. Discrete Event Dynamic Systems: Theory and Applications 1 (1991), 93–124.
123. Kamath, M., Suri, R., Sanders, J.L., Analytical performance models for closed-loop flexible assembly systems. Internat. J. Flexible Manuf. Syst. 1 (1988), 51–84.
124. Kamath, M., Viswanadham, N., Applications of Petri net based models in the modeling and analysis of flexible manufacturing systems. Proc. IEEE 1986 Internat. Conf. Robotics Automation, 1986, IEEE Computer Society Press, Chicago, IL, 312–317.
125. Karmarkar, U.S., Lot sizes, lead times and in-process inventories. Management Sci. 33 (1987), 409–418.
126. Karmarkar, U.S., Capacity loading, release planning and master scheduling with WIP and lead times. J. Manuf. Oper. Management, 1989.
127. Karmarkar, U.S., Kekre, S., Batching policy in Kanban systems. J. Manuf. Syst. 9:4 (1989), 317–328.
128. Karmarkar, U.S., Kekre, S., Kekre, S., Lot sizing in multi-item multi-machine job shops. IIE Trans. 17 (1985), 290–292.
129. Karmarkar, U.S., Kekre, S., Kekre, S., Freeman, S., Lotsizing and lead time performance in a manufacturing cell. Interfaces 15 (1985), 1–9.
130. Kelly, F.P., Networks of queues with customers of different types. J. Appl. Probab. 12 (1975), 542–554.
131. Kelly, F.P., Networks of queues. Adv. Appl. Prob. 8 (1976), 416–432.
132. Kelly, F.P., Reversibility and Stochastic Networks. 1979, Wiley, New York.
133. Kimemia, J.G., Gershwin, S.B., An algorithm for the computer control of production in flexible manufacturing systems. IIE Trans. 15:4 (1983), 353–362.
134. Kingman, J.F.C., Some inequalities for the GI/G/1 queue. Biometrika 49 (1962), 315–324.
135. Kleinrock, L., Queueing Systems Vol. 1: Theory. 1975, Wiley, New York.
136. Kleinrock, L., Queueing Systems Vol. 2: Computer Applications. 1976, Wiley, New York.
137. Kobayashi, H., Application of the diffusion approximation to queueing networks I: Equilibrium queue distributions. J. ACM 21 (1974), 316–328.
138. Koenigsberg, E., Production lines and internal storage — A review. Management Sci. 5 (1959), 401–433.
139. Koenigsberg, E., Twenty five years of cyclic queues and closed queue networks: A review. J. Oper. Res. Soc. 33 (1982), 605–619.
140. Koenigsberg, E., Mamer, A., The analysis of production systems. Internat. J. Prod. Res. 20 (1982), 1–14.
141. Kogan, Ya.A., Krichagina, E.V., Closed exponential queueing networks with blocking in heavy traffic. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, New York, 217–225.
142. Konheim, A.G., Reiser, M., A queueing model with finite waiting room and blocking. J. Assoc. Comput. Mach. 23:2 (1976), 328–341.
143. Konheim, A.G., Reiser, M., Finite capacity queueing systems with applications in computer modeling. SIAM J. Comput. 7:2 (1978), 210–229.
144. Kouvatsos, D.D., Maximum entropy methods for general queueing networks. Poltier, D., (eds.) Modelling Techniques and Tools for Performance Analysis, 1985, North-Holland, Amsterdam, 589–608.
145. Kouvatsos, D.D., Xenios, N.P., Maximum entropy analysis of general queueing networks with blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Amsterdam, 281–309.
146. Kraemer, W., Langenbach-Belz, M., Approximate formulae for the delay in the queueing system GI/G/1. Proc. 8th Internat. Teletraffic Congress, Melbourne, 1976, 235.
147. Kuehn, P.J., Approximate analysis of general queueing networks by decomposition. IEEE Trans. Comm. 27 (1979), 113–126.
148. Labetoulle, J., Pujolle, G., Isolation method in a network of queues. IEEE Trans. Software Engrg. 6:4 (1980), 373–381.
149. Lam, S.S., Lien, Y.L., A tree convoluted algorithm for the solution of queueing networks. Commun. ACM 26:3 (1983), 203–215.
150. Latouche, G., Queues with paired customers. J. Appl. Probab. 18 (1981), 684–690.
151. Lavenberg, S.S., (eds.) Computer Performance Modeling Handbook, 1983, Academic Press, Amsterdam.
152. Law, A.M., Haider, S.W., Selecting simulation software for manufacturing applications: Practical guidelines and software survey. Ind. Eng. 21 (1989), 33–46.
153. (4)Lazowska, E.D., Zahorjan, J., Multiple class memory constrained queueing networks. Proc. 1982 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Seattle, August 1982 Performance Evaluation Rev., 11, 1982, 130–140.
154. Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C., Quantitative System Performance: Computer System Analysis Using Queueing Network Models. 1984, Prentice-Hall, New York.
155. Lee, H.F., Srinivasan, M.M., Yano, C.A., An algorithm for the minimum cost configuration problem in flexible manufacturing systems. Stecke, K.E., Suri, R., (eds.) Proc. 3rd ORSA/TIMS Conf. on Flexible Manufacturing Systems: Operations Research Models and Applications, 1989, Elsevier, Englewood Cliffs, NJ, 85–90.
156. Leung, Y.T., Kamath, M., Performance analysis of synchronous production lines. IEEE Trans. Robotics and Automation 7:1 (1991), 1–8.
157. Leung, Y.T., Suri, R., Performance evaluation of discrete manufacturing systems. IEEE Control Syst. Mag., 1990, 77–86.
158. Lindley, D.V., The theory of queues with a single server. Proc. Cambridge Philos. Soc., 48, 1952, 277–289.
159. Lipper, E.H., Sengupta, B., Assembly-like queues with finite capacity: Bounds, asymptotics and approximations. Queueing Syst.: Theory Appl., 1, 1986, 67.
160. Little, J.D.C., A proof for the queueing formula L = λW. Oper. Res. 9 (1961), 383–387.
161. Liu, X.-G., Buzacott, J.A., A zero-buffer equivalence technique for decomposing queueing networks with blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Amsterdam, 87–104.
162. Liu, X.-G., Buzacott, J.A., Approximate models of assembly systems with finite inventory banks. European J. Oper. Res. 45:2–3 (1990), 143–154.
163. March Luber, A., Rapid modeling systems: A practical alternative to MRP II rough cut capacity planning. P & IM Rev., 1990.
164. Marchal, W.G., Numerical performance of approximate queueing formulae with application to flexible manufacturing systems. Ann. Oper. Res. 3 (1985), 141–152.
165. Marie, R., Modelisation par reseaux de files d'attente. Ph.D. Thesis, 1978, Université de Rennes, Amsterdam.
166. Marshall, K.T., Some inequalities in queueing. Oper. Res. 16 (1968), 651–665.
167. Mascolo, M.D., David, R., Dallery, Y., Modeling and analysis of assembly systems with unreliable machines and finite buffers. IIE Trans. 23:4 (1991), 315–330.
168. McKenna, J., Mitra, D., Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage. Bell Syst. Tech. J. 61:5 (1982), 661–683.
169. McKenna, J., Mitra, D., Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. J. ACM 31:2 (1984), 346–360.
170. Mitra, D., Mitrani, I., Analysis of a Kanban discipline for cell coordination in production lines. I. Management Sci. 36:12 (1990), 1548–1566.
171. Mitra, D., Mitrani, I., Analysis of a Kanban discipline for cell coordination in production lines. II: Stochastic demands. Oper. Res. 39:5 (1991), 807–823.
172. Mody, A., Sanders, J.L., Suri, R., Contreras, F., Rao, P.C., International Competition in the Bicycle Industry: Keeping Pace with Technological Change. 1991, The World Bank, France.
173. Mody, A., Suri, R., Sanders, J.L., Tatikonda, M., International Competition in the Printed Circuit Board Industry: Keeping Pace with Technological Change. 1991, The World Bank, Washington DC.
174. Mody, A., Suri, R., Sanders, J.L., Van Zoest, D., International Competition in the Footwear Industry: Keeping Pace with Technological Change. 1991, The World Bank, Washington, DC.
175. Muntz, R.R., Wong, J., Asymptotic properties of closed queueing network models. Proc. 8th Ann. Princeton Conf. on Information Science and Systems, 1974, Princeton University, Washington, DC.
176. Muth, E.J., The reversibility property of production lines. Management Sci. 25:2 (1979), 152–158.
177. Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models. 1981, Johns Hopkins University Press, Baltimore.
178. Nymon, J., Using analytical and simulation modeling for early factory prototyping. Proceedings of the 1987 Winter Simulation Conference, 1987, IEEE Computer Society Press, Baltimore, 721–724.
179. Ohmi, T., An approximation for the production efficiency of automatic transfer lines with in-process storages. AIIE Trans. 13:1 (1981), 22–28.
180. Olsder, G.J., Resing, J.A.C., De Vries, R.E., Keane, M.S., Hooghiemstra, G., Discrete event systems with stochastic processing times. Proc. 27th IEEE Conf. Decision and Control., 1988, IEEE Computer Society Press.
181. Onvural, R., On the exact decomposition of deadlock free closed queueing networks with blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Amsterdam, 73–83.
182. Onvural, R.O., Perros, H.G., Approximate throughput in cyclic queueing networks with blocking. IEEE Trans. Software Engrg. 15 (1990), 800–808.
183. Palesano, J., Chandra, J., A machine interference problem with multiple types of failures. Internat. J. Prod. Res. 24:3 (1986), 567–582.
184. Pattipati, K.R., Kastner, M.P., A hierarchical queueing network model of a large electronics test facility. Inform. Decision Tech. 14:1 (1988), 45–64.
185. Perros, H.G., Queueing networks with blocking: A bibliography. Performance Evaluation Rev., ACM SIGMETRICS 12 (1984), 8–12.
186. Perros, H.G., Altiok, T., Approximate analysis of open networks of queues with blocking: Tandem configurations. IEEE Trans. on Software Engrg. 12:3 (1986), 450–461.
187. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Amsterdam.
188. Pollock, S.M., Birge, J.R., Alden, J.M., Approximation analysis for open tandem queues with blocking: Exponential and general service distribution. Technical Report 85-30, 1985, Department of Industrial and Operations Engrg., The University of Michigan, Amsterdam.
189. Ramadge, P.J., Wonham, W.M., The control of discrete event systems. Proc. IEEE, 77, 1989, 81–98.
190. Reiman, M, Open queueing networks in heavy traffic. Math. Oper. Res. 9 (1984), 441–458.
191. Reiman, M.I., Weiss, A., Sensitivity analysis for simulations via likelihood ratios. Oper. Res. 37 (1989), 830–844.
192. Reiser, M., A queueing network analysis of computer communication networks with window flow control. IEEE Trans. Comm. 27 (1979), 1199–1209.
193. Reiser, M., Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation 1 (1981), 7–18.
194. Reiser, M., Kobayashi, H., Accuracy of the diffusion approximation for some queueing systems. IBM J. Res. Develop. 18 (1974), 110–124.
195. Reiser, M., Kobayashi, H., Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. Develop. 19 (1976), 283–294.
196. Reiser, M., Lavenberg, S.S., Mean-value analysis of closed multichain queueing networks. J. ACM 27 (1980), 313–322.
197. Robertazzi, T.G., Lazar, A.A., On the modeling and optimal flow control of the Jacksonian network. Performance Evaluation 5 (1985), 29–43.
198. Ross, S.M., Introduction to Probability Models. 1989, Academic Press, Ann Arbor, MI.
199. Rubinstein, R.Y., Sensitivity analysis and performance extrapolation for computer simulation models. Oper. Res. 37 (1989), 72–81.
200. Saboo, S., Wilhelm, W.E., An approach for modeling small-lot assembly networks. IIE Trans. 18 (1986), 322–334.
201. Sauer, C.H., Chandy, K.M., Computer System Performance Evaluation. 1981, Prentice-Hall, Orlando, FL.
202. Schassberger, R., The insensitivity of stationary probabilities in networks of queues. Adv. Appl. Prob. 10 (1978), 906–912.
203. Schonberger, R.J., Japanese Manufacturing Techniques: Nine Hidden Lessons in Simplicity. 1982, The Free Press, Englewood Cliffs, NJ.
204. Schonberger, R.J., Applications of single-card and dual-card Kanban. Interfaces 13:4 (1983), 56–67.
205. Schonberger, R.J., World Class Manufacturing: The Lessons of Simplicity Applied. 1986, The Free Press, New York.
206. Presented at Schweitzer, P., Approximate analysis of multiclass closed networks of queues. the International Conference, Stochastic Control and Optimization, Amsterdam, The Netherlands, 1979.
207. Schweitzer, P.J., Altiok, T., Aggregate modeling of tandem queues without intermediate buffers. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, New York, 47–72.
208. Schweitzer, P.J., Seidmann, A., Shalev-Oren, S., The correction terms in approximate mean value analysis. Oper. Res. Lett., 4(5), 1986.
209. Segal, M., Whitt, W., A queueing network analyzer for manufacturing. Proc. 12th Internat. Teletraffic Congress, Torino, Italy, June 1988, 1989, 1146–1152.
210. Seidmann, A., Regenerative pull (Kanban) production control policies. European J. Oper. Res. 35 (1988), 401–413.
211. Seidmann, A., Nof, S.Y., Unitary manufacturing cell design with random product feedback flow. IIE Trans. 17 (1985), 188–193.
212. Seidmann, A., Schweitzer, P.J., Shalev-Oren, S., Computerized closed queueing network models of flexible manufacturing systems: A comparative evaluation. Large Scale Systems 12 (1987), 91–107.
213. Sevcik, K.C., Levy, A.I., Tripathi, S.K., Zahorjan, J.L., Improving approximations of aggregated queueing network subsystems. Chandy, K.M., Reiser, M., (eds.) Computer Performance, 1977, North-Holland, Amsterdam, 1–22.
214. Sevcik, K.C., Mitrani, I., The distribution of queueing network states at input and output instants. Performance of Computer Systems, 1979, North-Holland, Amsterdam, 319–335.
215. Shalev-Oren, S., Seidmann, A., Schweitzer, P.J., Analysis of flexible manufacturing systems with priority scheduling: PMVA. Ann. Oper. Res. 3 (1985), 115–139.
216. Shanthikumar, J.G., Buzacott, J.A., On the approximations to the single server queue. Internat. J. Prod. Res. 18 (1980), 761–773.
217. Shanthikumar, J.G., Buzacott, J.A., Open queueing network models of dynamic job shops. Internat. J. Prod. Res. 19 (1981), 255–266.
218. Shanthikumar, J.G., Buzacott, J.A., The time spent in a dynamic job shop. European J. Oper. Res. 17 (1984), 215–226.
219. Shanthikumar, J.G., Gocmen, M., Heuristic analysis of closed queueing networks. Internat. J. Prod. Res. 21 (1983), 675–690.
220. Shanthikumar, J.G., Sargent, R.G., A unifying view of hybrid simulation/analytic models and modeling. Oper. Res. 31:6 (1983), 1030–1052.
221. Shanthikumar, J.G., Sumita, U., Approximations for the time spent in a dynamic job shop with applications to due date assignment. Internat. J. Prod. Res. 26 (1988), 1329–1352.
222. Shanthikumar, J.G., Yao, D.D., Stochastic monotonicity of the queue lengths in closed queueing networks. Oper. Res. 35 (1987), 583–588.
223. Shanthikumar, J.G., Yao, D.D., Second-order stochastic properties in queueing systems. Proc. IEEE, 77, 1989, 162–170 1.
224. Shanthikumar, J.G., Yao, D.D., Spatiotemporal convexity of stochastic processes and applications. Probab. Engrg. Inform. Sci. 6 (1992), 1–16.
225. to appear Shimizu, M., Application of an integrated modeling approach to design and analysis of manufacturing systems. Adv. Manuf. Engrg., 1991.
226. Shimizu, M., Van Zoest, D., Analysis of a factory of the future using an integrated set of software for manufacturing systems modeling. Proc. 1988 Winter Simulation Conf., 1988, IEEE Computer Society Press, New York, 671–677.
227. Shore, J.E., Johnson, R.W., Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Inform. Theory 26:1 (1980), 26–37.
228. Shore, J.E., Johnson, R.W., Properties of cross-entropy minimization. IEEE Trans. Inform. Theory 27:4 (1981), 472–482.
229. Shum, A.W., Buzen, J.P., The EPF technique: A method for obtaining approximate solutions to closed queueing networks with general service times. Proc. 3rd Internat. Sympos. on Measuring, Modelling and Evaluating Comput. Systems, Bonn, Germany, 1977, North-Holland, Amsterdam, 201–220.
230. Solberg, J.J., A mathematical model of computerized manufacturing systems. Proc. 4th Internat. Conf. Production Research, Tokyo, Japan, 1977.
231. Spearman, M.L., An analytic congestion model for closed production systems with IFR processing times. Management Sci. 37:8 (1991), 1015–1029.
232. Spearman, M.L., Woodruff, D.L., Hopp, W.J., CONWIP: A pull alternative to Kanban. Internat. J. Prod. Res. 28:5 (1990), 879–894.
233. Spearman, M.L., Zazanis, M.A., Push and pull production systems: Issues and comparisons. Oper. Res. 40:3 (1992), 521–532.
234. Spragins, J., Analytical queueing models: Guest editors introduction. IEEE Computer 13:4 (1980), 9–11.
235. Stecke, K.E., Machine interference: The assignment of machines to operators. Salvendy, G., (eds.) Handbook of Industrial Engineering, 1982, Wiley, Amsterdam.
236. Stecke, K.E., Design, planning, scheduling, and control problems of flexible manufacturing systems. Ann. Oper. Res. 3 (1985), 3–12.
237. Stecke, K.E., Aronson, J.E., Review of operator/machine interference models. Internat. J. Prod. Res. 23:1 (1985), 129–151.
238. Stecke, K.E., Solberg, J.J., The optimality of unbalancing both workloads and machine group sizes in closed queueing networks of multi-server queues. Oper. Res. 33:4 (1985), 882–910.
239. Stecke, K.E., Suri, R., Flexible Manufacturing Systems: Operations Research Models and Applications. 1985, J.C. Baltzer, New York.
240. Stecke, K.E., Suri, R., Proceedings of the Second ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications. 1986, Elsevier, Basel, Switzerland.
241. Stecke, K.E., Suri, R., (eds.) Flexible Manufacturing Systems: Operations Research Models and Applications II, 1988, J.C. Baltzer, Amsterdam.
242. Stecke, K.E., Suri, R., Proceedings of the Third ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications. 1989, Elsevier, Basel, Switzerland.
243. Stidham, S., A last word on L = λW. Oper. Res. 22 (1974), 417–421.
244. (English edition, edited and revised by D.J. Daley) Stoyan, D., Comparison Methods for Queues and Other Stochastic Models. 1983, Wiley, Amsterdam.
245. Suri, R., Robustness of queueing network formulas. J. ACM 30:3 (1983), 564–594.
246. Suri, R., An overview of evaluative models for flexible manufacturing systems. Ann. Oper. Res. 3 (1985), 13–21.
247. Chapter 31 Suri, R., Quantitative techniques for robotic systems analysis. Nof, S.Y., (eds.) Handbook of Industrial Robotics, 1985, Wiley, New York.
248. Suri, R., A concept of monotonicity and its characterization for closed queueing networks. Oper. Res. 33 (1985), 606–624.
249. Suri, R., A new perspective on manufacturing systems analysis. Compton, W.D., (eds.) Design and Analysis of Integrated Manufacturing Systems, 1988, National Academy Press, New York, 118–133.
250. Suri, R., RMT puts manufacturing at the helm. Manuf. Engrg. 100:2 (1988), 41–44.
251. Suri, R., Perturbation analysis: The state of the art and research issues explained via the G/G/1 queue. Proc. IEEE, 77, 1989, 114–137.
252. Suri, R., Lead time reduction through rapid modeling. Manuf. Syst. 7 (1989), 66–68.
253. Suri, R., DeTreville, S., Getting from ‘Just-in-Case’ to ‘Just-in-Time’: Insights from a simple model. J. Oper. Management 6:3 (1986), 295–304.
254. Suri, R., DeTreville, S., Full speed ahead: A look at rapid modeling technology in operations management. OR/MS Today 18 (1991), 34–42.
255. Suri, R., DeTreville, S., Rapid modeling: The use of queueing models to support time-based competitive manufacturing. Fandel, G., (eds.) Proceedings of the German/U.S. Conference on Recent Developments in Operations Research, 1992, Springer, Washington, DC.
256. Suri, R., Diehl, G.W., A variable buffer-size model and its use in analyzing closed queueing networks with blocking. Management Sci. 32:2 (1986), 206–224.
257. Suri, R., Diehl, G.W., Rough-cut modeling: An alternative to simulation. CIM Rev. 3 (1987), 25–32.
258. Suri, R., Diehl, G.W., Dean, R., Quick and easy manufacturing systems analysis using MANUPLAN. Proc. Spring IIE Conf., Dallas, TX, 1986, IIE, Berlin, 195–205.
259. Suri, R., Dille, J.W., A technique for on-line sensitivity analysis of flexible manufacturing systems. Ann. Oper. Res. 3 (1985), 381–391.
260. Suri, R., Fu, B.R., On using continuous flow lines for performance estimation of discrete production lines. Nelson, B.L., Kelton, W.D., Clark, G.M., (eds.) Proceedings of the 1991 Winter Simulation Conference, 1991, 968–977.
261. Suri, R., Hildebrant, R.R., Modeling flexible manufacturing systems using mean-value analysis. J. Manuf. Syst. 3:1 (1984), 27–38.
262. Suri, R., Shimizu, M., Design for analysis: A new strategy to improve the design process. Res. Engrg. Des. 1 (1989), 105–120.
263. Suri, R., Tomsicek, M., Rapid modeling tools for manufacturing simulation and analysis. Proc. 1988 Winter Simulation Conference, 1988, IEEE Computer Society Press, Norcross, GA, 25–32.
264. Suri, R., Tomsicek, M., Derleth, D., Manufacturing systems modeling using ManuPlan and SimStarter: A tutorial. Proc. 1990 Winter Simulation Conference, 1990, IEEE Computer Society Press, 168–176.
265. Suri, R., Whitney, C.K., Decision support requirements in flexible manufacturing. J. Manuf. Syst. 3:1 (1984), 61–69.
266. Takacs, L., Introduction to the Theory of Queues. 1962, Oxford Univ. Press, Oxford.
267. Takahashi, Y., Aggregate approximation of acyclic queueing networks with communication blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Oxford, 33–46.
268. Takahashi, Y., Miyahara, H., Hasegawa, T., An approximation method for open restricted queueing networks. Oper. Res. 28:3 (1980), 594–602.
269. Tay, Y.C., Suri, R., Error bounds for performance prediction in queueing networks. ACM Trans. Comput. Syst. 3:3 (1985), 227–254.
270. Tijms, H.C., Stochastic Modelling and Analysis: A Computational Approach. 1988, Wiley, Amsterdam.
271. Trivedi, K.S., Probability and Statistics with Reliability, Queueing, and Computer Science Applications. 1982, Prentice-Hall, New York.
272. Uzsoy, R., Martin-Vega, L.A., Modelling Kanban-based demand-pull systems: A survey and critique. Manuf. Rev. 3:3 (1990), 155–160.
273. Van der Wal, J., Monotonicity of the throughput of a closed exponential queueing network in the number of jobs. OR Spektrum 11 (1989), 97–100.
274. Van Dijk, N.M., A simple bounding methodology for non-product-form queueing networks with blocking. Perros, H.G., Altiok, T., (eds.) Queueing Networks with Blocking, 1989, Elsevier, Englewood Cliffs, NJ, 3–17.
275. Vinod, B., Solberg, J.J., The optimal design of flexible manufacturing systems. Internat. J. Prod. Res. 23:6 (1985), 1141–1151.
276. Viswanadham, N., Narahari, Y., Performance Modeling of Automated Manufacturing Systems. 1992, Prentice-Hall, Amsterdam.
277. Wang, L., Wilhelm, W.E., Management of component accumulation in small-lot assembly systems. Working Paper 1985-005, 1985, Department of Industrial and Systems Engineering, Ohio State University, Englewood Cliffs, NJ.
278. Wein, L.M., Optimal control of a two-station Brownian network. Mth. Oper. Res. 15 (1990), 215–242.
279. Wein, L.M., Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 (1990), 1065–1078.
280. Wein, L.M., Brownian networks with discretionary routing. Oper. Res. 39:2 (1991), 322–340.
281. Whitt, W., Approximating a point process by a renewal process: Two basic methods. Oper. Res. 30 (1982), 125–147.
282. Whitt, W., The queueing network analyzer. Bell Syst. Tech. J. 62 (1983), 2779–2815.
283. Whitt, W., Approximations to departure processes and queues in series. Naval Res. Logist. Quart. 31 (1984), 499–521.
284. Whitt, W., Open and closed networks of queues. AT&T Bell Lab. Tech. J. 63 (1984), 1911–1979.
285. Whitt, W., The best order of queues in series. Management Sci. 31:4 (1985), 475–487.
286. to appear Whitt, W., Approximations for the GI/G/m queue. Adv. Appl. Probab., 1989.
287. Wilhelm, W., A model to approximate transient performance of the flowshop. Internat. J. Prod. Res. 24:1 (1986), 33–50.
288. Wilhelm, W., The application of lognormal models of transient operations in the flexible manufacturing environment. J. Manuf. Syst. 5:4 (1986), 253–266.
289. Wilhelm, W., Ahmadi-Marandi, S., A methodology to describe the operating characteristics of assembly systems. IIE Trans. 14:3 (1982), 204–213.
290. Wilhelm, W., Saboo, S., Johnson, R., An approach for designing capacity and managing material flow in small-lot assembly lines. J. Manuf. Syst. 5:3 (1986), 147–160.
291. Williams, A.C., Bhandiwad, R.A., A generating function approach to queueing network models of multiprogrammed computer systems. Network 6 (1976), 1–22.
292. Wolff, R.W., Stochastic Modeling and the Theory of Queues. 1989, Prentice-Hall, Englewood Cliffs, NJ.
293. Yamazaki, G., Kawashima, T., Sakasegawa, H., Reversibility of tandem blocking queueing systems. Management Sci. 31:1 (1985), 78–83.
294. Yao, D.D., Some properties of the throughput function of closed networks of queues. Oper. Res. Lett. 3:6 (1985), 313–317.
295. Yao, D.D., Modeling flexible manufacturing systems using product form queueing networks. White, J.A., Pence, I.W., (eds.) Progress in Materials Handling and Logistics, Vol. I, 1989, Springer, Englewood Cliffs, NJ, 223–235.
296. Yao, D.D., Buzacott, J.A., Queueing models for a flexible machining station. Part I: The diffusion approximation. European J. Oper. Res. 19 (1985), 233–240.
297. Yao, D.D., Buzacott, J.A., Modeling the performance of manufacturing systems. Internat. J. Prod. Res. 23 (1985), 945–959.
298. Yao, D.D., Buzacott, J.A., Queueing models for a flexible machining station, Part II: The method of Coxian phases. European J. Oper. Res. 19 (1985), 241–252.
299. Yao, D.D., Buzacott, J.A., The exponentialization approach to flexible manufacturing systems models with general processing times. European J. Oper. Res. 24 (1986), 410–416.
300. Yao, D.D., Buzacott, J.A., Models of flexible manufacturing systems with limited local buffers. Internat. J. Prod. Res. 24 (1986), 107–118.
301. Yao, D.D., Shanthikumar, J.G., Some resource allocation problems in multi-cell systems. Proc. 2nd ORSA/TIMS Conf. on Flexible Manufacturing Systems, Ann Arbor, MI, 1986, Elsevier, Berlin, 245–256.
302. Yao, D.D., Shanthikumar, J.G., Optimal server allocation in a system of multi-server stations. Management Sci. 33:9 (1987), 1173–1180.
303. Zahorjan, J., The approximate solution of large queueing network models. Ph.D. Dissertation Tech. Rep. CSRG-122, 1980, Univ. of Toronto, Amsterdam.
304. Zahorjan, J., Sevcik, K.C., Eager, D.L., Galler, B.I., Balanced job bound analysis of queueing networks. Commun. ACM 25:2 (1982), 134–141.
305. Zipkin, P.H., Models for design and control of stochastic, multi-item batch production systems. Oper. Res. 34 (1986), 91–104.