Skip to main content
SpringerLink
Log in

Approximate performance modeling and decision making for manufacturing systems: A queueing network optimization framework

  • Papers
  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In this paper we discuss queueing network methodology as a framework to address issues that arise in the design and planning of discrete manufacturing systems. Our review focuses on three aspects: modeling of manufacturing facilities, performance evaluation and optimization with queueing networks. We describe both open and closed network models and present several examples from the literature illustrating applications of the methodology. We also provide a brief outline of outstanding research issues. The paper is directed towards the practitioner with operations research background and the operations management researcher with interest in this topic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Akyildiz, I. F. (1988) Mean value analysis for blocking queueing networks.IEEE Transactions on Software Engineering,14, 418–28.

    Google Scholar 

  • Albin, S. L. (1984) Approximating a point process by a renewal process. II. Superposition arrival processes to queues.Operations Research,32, 1133–62.

    Google Scholar 

  • Barbour, A. D. (1976) Networks of queues and the method of stages.Advanced Applied Probability,8, 584–91.

    Google Scholar 

  • Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975) Open, closed and mixed networks of queues with different classes of customers.Journal of Association for Computing Machinery,22, 248–60.

    Google Scholar 

  • Bitran, G. R. and Dasu, S. (1989) Computational Procedures for GPH/PH/1 Queue.Operations and Technology Management Working Paper #10-89, UCLA, USA.

    Google Scholar 

  • Bitran, G. R. and Dasu, S. (1990) Approximating Non-Renewal Processes by Markov Chains.Operations and Technology Management Working Paper #4-90, UCLA, USA.

    Google Scholar 

  • Bitran, G. R., Peterson, W. P. and Tirupati, D. (1987) Some recent advances in capacity planning for discrete manufacturing systems, inModern Production Management Systems, Kusiak, A. (ed.), Elsevier Science, North-Holland, pp. 201–13.

    Google Scholar 

  • Bitran, G. R. and Tirupati, D. (1988) Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference.Management Science,34, 75–100.

    Google Scholar 

  • Bitran, G. R., and Tirupati, D. (1989a) Capacity planning with discrete options in manufacturing networks.Annals of Operations Research,17, 119–36.

    Google Scholar 

  • Bitran, G. R. and Tirupati, D. (1989b) Trade-off curves, targeting and balancing in manufacturing networks.Operations Research,37, 547–64.

    Google Scholar 

  • Bitran, G. R. and Tirupati, D. (1989c) Approximations for product departures from a single server station with batch processing in multi-product queues.Management Science,35, 851–78.

    Google Scholar 

  • Bitran, G. R. and Tirupati, D. (1991) Approximations for networks of queues with overtime.Management Science, March.

  • Bondi, A. B. (1984) Incorporating Open Queueing Models into Closed Queueing Network Algorithms, PhD dissertation, Purdue University, USA.

    Google Scholar 

  • Bondi, A. B. and Whitt, W. (1986) The influence of service-time variability in a closed network of queues.Performance Evaluation,6, 219–34.

    Google Scholar 

  • Boxma, O. J., Rinnooy Kan, A. H. G. and van Vliet, M. (1990) Machine allocation problems in manufacturing networks.European Journal of Operations Research,45, 47–54.

    Google Scholar 

  • Brandwajn, A. and Jow, Y. L. (1988) An approximation method for tandem queues with blocking.Operations Research,36, 73–83.

    Google Scholar 

  • Bruell, S. C. and Balbo, G. (1980)Computational algorithms for closed queueing networks, North-Holland, NY.

    Google Scholar 

  • Bryant, R. M., Krzesinski, A. E., Laksuri, M. S. and Chandy, K. M. (1984) The MVA priority approximation.ACM Transaction on Computer Systems,2, 335–59.

    Google Scholar 

  • Buglak, A. A. and Sanders, J. L. (1989) Modeling and design optimization of asynchronous flexible assembly systems with statistical process control and repair.Technical Report, University of Wisconsin-Madison, USA.

    Google Scholar 

  • Buzacott, J. A. and Shanthikumar, J. G. (1985) Approximate queueing models of dynamic job shops.Management Science,31, 870–87.

    Google Scholar 

  • Buzacott, J. A. and Yao, D. D. (1986a) On queueing network models of flexible manufacturing systems.Queueing Systems,1, 5–27.

    Google Scholar 

  • Buzacott, J. A. and Yao, D. D. (1986b) Flexible manufacturing systems: a review of analytical models.Management Science,32, 890–905.

    Google Scholar 

  • Buzen, J. P. (1973) Computational algorithms for closed queueing networks with exponential servers.Communications ACM,16, 527–31.

    Google Scholar 

  • Calabrese, J. (1988) Optimal workload allocation in open queueing networks of multiserver queues.Working Paper, Stanford University, California, USA.

    Google Scholar 

  • Chandy, K. M., Hogarth, J. and Sauer, C. H. (1977) Selecting capacities in computer communication systems.IEEE Transactions on Software Engineering SE-3, 290–5.

    Google Scholar 

  • Chandy, K. M. and Nense, D. (1982) Linearizer: a heuristic algorithm for queueing network models of computing systems.Communications ACM,25, 126–34.

    Google Scholar 

  • Chandy, K. M. and Sauer, C. H. (1978) Approximate methods for analyzing queueing network models of computer systems.ACM Computing Surveys,10, 281–317.

    Google Scholar 

  • Co, H. C. and Wysk, R. A. (1986) The robustness of CAN-Q in modeling automated manufacturing systems.The International Journal of Production Research,24, 1485–503.

    Google Scholar 

  • Conway, A. E. and Georganas, N. D. (1990)Queueing networks-exact computational algorithms, MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Dallery, Y. and Frein, Y. (1988) An efficient method to determine the optimal configuration of a flexible manufacturing system.Annals of Operations Research,15, 207–25.

    Google Scholar 

  • de Souze, E., Silva, E. and Muntz, R. R. (1987) Approximate solutions for a class of non-product form queueing network models.Performance Evaluation,7, 221–42.

    Google Scholar 

  • Denardo, E. V. and Tang, C. S. (1989) Bilinear control of Markov production systems.Working Paper, Anderson School of Management, UCLA, USA.

    Google Scholar 

  • Denning, P. J. and Buzen, J. P. (1978) The operational analysis of queueing network models.Computing Surveys,10, 225–61.

    Google Scholar 

  • Disney, R. L. and Konig, D. (1985) Queueing networks: a survey of their random processes.SIAM Review,27, 335–403.

    Google Scholar 

  • Fendick, K. W., Saksena, V. R. and Whitt, W. (1989) Dependence in packet queues.IEEE Transaction on Communications,37, 1173–83.

    Google Scholar 

  • Fendick, K. W. and Whitt, W. (1989) Measurements and approximations to describe the offered traffic and predict the average work load in a single-server queue.Proceedings of IEEE,77, 171–94.

    Google Scholar 

  • Francis, R. L. and White, J. A. (1974)Facility Layout and Location: An Analytical Approach, Prentice Hall, New Jersey.

    Google Scholar 

  • Gershwin, S. B. and Schick, I. C. (1983) Modelling and analysis of three stage transfer lines, with unreliable machines and finite buffers.Operations Research,31, 354–80.

    Google Scholar 

  • Glynn, P. E. (1986) Monte Carlo optimization of stochastic systems: two new approaches, inProceedings of ASME Computers in Engineering Conference.

  • Gordon, J. J. (1990) The evaluation of normalizing constants in Closed Queueing Networks.Operations Research,38, 863–9.

    Google Scholar 

  • Gordon, W. J. and Newell, G. F. (1967a) Closed queueing systems with exponential servers.Operations Research 15, 245–65.

    Google Scholar 

  • Gordon, W. J. and Newell, G. F. (1967b) Acknowledgement,Operations Research,15, 1182.

    Google Scholar 

  • Gray, A. E., Seidmann, A. and Stecke, K. E. (1988) Tool management in automated manufacturing: operational issues and decisions problems.Working Paper, The University of Michigan, MI, USA.

    Google Scholar 

  • Harrison, J. M. (1988) Brownian models of queueing networks with heterogeneous customer population, inStochastic Differential Systems, Stochastic Control Theory and their Applications, Fleming, W. and Liam, P. L. (eds), Springer, New York, pp. 147–86.

    Google Scholar 

  • Harrison, J. M. and Nguyen, V. (1990) The Qnet method for two-moment analysis of open queueing networks.Queueing Systems,6, 1–32.

    Google Scholar 

  • Harrison, J. M. and Wein, L. M. (1988) Scheduling networks of queues: heavy traffic analysis of a two-station closed network, to appear inOperations Research.

  • Harrison, J. M. and Williams, R. J. (1987a) Multidimensional reflected Brownian motions have exponential stationary distributions.Annals of Probability,15, 115–37.

    Google Scholar 

  • Harrison, J. M. and Williams, R. J. (1987b) Brownian models of open queueing networks with homogeneous customer populations.Stochastics 22, 77–115.

    Google Scholar 

  • Harrison, P. G. (1985) On normalizing constants in queueing networks.Operations Research,33, 464–8.

    Google Scholar 

  • Hitomi, K. (1979)Manufacturing Systems Engineering, Taylor and Francis, London.

    Google Scholar 

  • Ho, Y. C., Eyler, M. A. and Chien, T. T. (1979) A gradient technique for general buffer storage design in a serial production line.International Journal of Production Research,17, 557–80.

    Google Scholar 

  • Jackson, J. R. (1957) Networks of waiting lines.Operations Research,5, 518–21.

    Google Scholar 

  • Jackson, J. R. (1963) Jobshop-like queueing systems.Management Science,10, 131–42.

    Google Scholar 

  • Kelly, F. P. (1975) Networks of queues with customers of different types.Journal of Applied Probability,12, 542–54.

    Google Scholar 

  • Kelly, F. P. (1976) Networks of queues.Advanced Applied Probability,8, 416–32.

    Google Scholar 

  • Kelly, F. P. (1979)Reversibility and stochastic networks, Wiley, New York.

    Google Scholar 

  • Kleinrock, L. (1975)Queueing Systems, Vol. I, Wiley, Interscience, NY.

    Google Scholar 

  • Kleinrock, L. (1976)Queueing Systems, Vol. II, Wiley, Interscience, NY.

    Google Scholar 

  • Koenigsberg, E. (1958) Cyclic queues.Operational Research,9, 22–35.

    Google Scholar 

  • Koenigsberg, E. (1986) Comments on ‘Normalizing constants in queueing networks’ by P. G. Harrison.Operations Research,34, 330.

    Google Scholar 

  • Kouvelis, P. and Kiran, A. S. (1991) The plant layout problem in automated manufacturing systems.Annals of Operations Research (forthcoming).

  • Kouvelis, P. and Lee, H. L. (1990) The optimal system configuration of a flexible manufacturing system.Working Paper, University of Texas at Austin, Texas, USA.

    Google Scholar 

  • Kraemer, W. and Langenbach-Belz, M. (1976) Approximate formulae for the delay in the queueing system GI/G/1,Congressbook, 8th ITC, Melbourne,235, 1–235.8.

  • Kuehn, P. J. (1979) Approximate analysis of general networks by decomposition.IEEE Transaction Communication,COM-27, 113–26.

    Google Scholar 

  • Lam, S. S. (1983) A simple derivation of the MVA and LBANC algorithms from the convolution algorithm.IEEE Transaction on Computers,32, 1062–4.

    Google Scholar 

  • Lavenberg, S. S. (ed.) (1983)Computer performance modeling handbook, Academic Press, New York.

    Google Scholar 

  • Lavenberg, S. S. and Reiser, M. (1980) Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers.Journal of Applied Probability,17, 1048–61.

    Google Scholar 

  • Lee, H. L. and Cohen, M. A. (1983) A note on the convexity of performance measures of M/M/c queueing systems.Journal of Applied Probability,20, 920–3.

    Google Scholar 

  • Little, J. P. C. (1961) A proof of the queueing formula L=λW.Operations Research,9, 383–7.

    Google Scholar 

  • Perros, H. G. and Altiok, T. (eds) (1989)Queueing networks with blocking, Elsevier Science, New York.

    Google Scholar 

  • Posner, M. and Bernholz, B. (1968) Closed finite queueing networks with time lags.Operations Research,16, 962–76.

    Google Scholar 

  • Price, T. G. (1974) Probability models of multiprogrammed computer systems, PhD dissertation, Stanford University, California, USA.

    Google Scholar 

  • Reiser, M. and Kobayashi, H. (1973) Recursive algorithms for general queueing networks and exponential servers.IBM Research Report, RC4254, Yorktown Heights, NY.

  • Reiser, M. and Kobayashi, H. (1974) Accuracy of diffusion approximation for some queueing systems.IBM Journal of Research and Development,18, 110–24.

    Google Scholar 

  • Reiser, M. and Lavenberg, S. S. (1980) Mean value analysis of closed multichain queueing networks.Journal of Association for Computing Machinery,27, 313–22.

    Google Scholar 

  • Rubinstein, R. Y. (1989) Sensitivity analysis and performance extrapolation for computer simulation models.Operations Research,37, 72–81.

    Google Scholar 

  • Schweitzer, P. J. (1977) Maximum throughput in finite-capacity open queueing networks and product form solutions.Management Science,24, 217–33.

    Google Scholar 

  • Schweitzer, P. J. (1979) Approximate analysis of multiclass closed networks of queues, inProceedings of the International Conference on Stochastic Control and Optimization, Free University, Amsterdam.

    Google Scholar 

  • Schweitzer, P. and Seidmann, A. (1988) Optimizing processing rates for flexible manufacturing systems.Working Paper, University of Rochester, New York, USA.

    Google Scholar 

  • Segal, M. and Whitt, W. (1988) A queueing network analyzer for manufacturing, inProceedings of 12th International Teletraffic Congress, Torino, Italy.

  • Seidmann, A., Schweitzer, P. J. and Shalev-Oren, S. (1987) Computerized closed queueing network models of flexible manufacturing systems: a comparative evaluation.Large Scale Systems,12, 91–107.

    Google Scholar 

  • Sevcik, K. C., Levy, A. I., Tripathi, S. K. and Zahorjan, J. L. (1977) Improving approximations of aggregated queueing network systems, inProceedings of Computer Performance, Modeling, Measurement and Evaluation.

  • Sevcik, K. C. and Mitrani, I. (1981) The distribution of queueing network states at input and output instants.Journal of Association for Computing Machinery,28, 358–471.

    Google Scholar 

  • Shaked, M. and Shanthikumar, J. G. (1988) Stochastic convexity and its applications.Advances in Applied Probability,20, 427–46.

    Google Scholar 

  • Shalev-Oren, S., Seidmann, A. and Schweitzer, P. J. (1985) Analysis of flexible manufacturing systems with priority scheduling: PMVA.Annals of Operations Research,6, 115–39.

    Google Scholar 

  • Shanthikumar, J. G. (1987) Stochastic majorization of random variables with propositional equilibrium rates.Advances in Applied Probability,19, 854–72.

    Google Scholar 

  • Shanthikumar, J. G. and Buzacott, J. A. (1980) On the approximations to the single server queue.International Journal of Production Research,18, 761–73.

    Google Scholar 

  • Shanthikumar, J. G. and Buzacott, J. A. (1981) Open queueing network models for dynamic job shops.International Journal of Production Research,19, 255–66.

    Google Scholar 

  • Shanthikumar, J. G. and Stecke, K. E. (1986) Reducing work-inprocess inventory in certain classes of flexible manufacturing systems.European Journal of Operations Research,26, 266–71.

    Google Scholar 

  • Shanthikumar, J. G. and Yao, D. D. (1987) Optimal server allocation in a system of multiserver stations.Management Science,33, 1173–80.

    Google Scholar 

  • Shanthikumar, J. G. and Yao, D. D. (1988) On server allocation in multiple center manufacturing systems.Operations Research,36, 333–42.

    Google Scholar 

  • Solberg, J. J. (1977) A mathematical model of computerized manufacturing systems, inProceedings of the 4th International Conference on Production Research, Tokyo, Japan.

  • Spearman, M. L. and Zazanis, M. A. (1990) Push and pull systems: issues and comparisons.Technical Report 88-24, Northwestern University, USA.

    Google Scholar 

  • Stecke, K. E. and Morin, T. L. (1985) Optimality of balancing workloads in certain types of flexible manufacturing systems.European Journal of Operations Research,20, 68–82.

    Google Scholar 

  • Stecke, K. E. and Solberg, J. J. (1985) The optimality of unbalancing both workloads and machine group sizes in closed queueing networks of multiserver queues.Operations Research,33, 882–910.

    Google Scholar 

  • Suresh, S. and Whitt, W. (1990) The heavy-traffic bottleneck phenomenon in open queueing networks.Operations Research Letters,9, 355–62.

    Google Scholar 

  • Suri, R. (1983) Robustness of queueing network formulae.Journal of Association for Computing Machinery,30, 564–94.

    Google Scholar 

  • Suri, R. (1989) Perturbation analysis: the state-of-the-art and research issues explained via the GI/G/1 Queue, inProceedings of the IEEE,77, 114–37.

  • Suri, R. and Hildebrant, R. R. (1984) Modeling flexible manufacturing systems using mean value analysis.Journal of Manufacturing Systems,3, 27–8.

    Google Scholar 

  • Suri, R. and Whitney, C. K. (1984) Decision support requirements in flexible manufacturing.SME Journal of Manufacturing Systems,3, 61–9.

    Google Scholar 

  • Suri, R. and Zazanis, M. A. (1988) Perturbation analysis gives strongly consistent estimates for the M/G/1 queue.Management Science,34, 39–64.

    Google Scholar 

  • Tapiero, C. S. and Hsu, L. F. (1988) Quality control of an unreliable random FMS with Bernouli and CSP sampling.International Journal of Production Research,26, 1125–35.

    Google Scholar 

  • Trivedi, K. S. and Sigmon, T. M. (1981) Optimal design of linear storage hierarchies.Journal of Association for Computing Machinery,28, 270–88.

    Google Scholar 

  • Trivedi, K. S. and Wagner, R. A. (1979) A decision model for closed queueing networks.IEEE Trans. Software Engr.,5, 328–32.

    Google Scholar 

  • Trivedi, K. S., Wagner, R. A. and Sigmon, T. M. (1980) Optimal selection of CPU speed, device capabilities and file assignments.Journal of Association for Computing Machinery,27, 457–573.

    Google Scholar 

  • van Vliet, M. and Rinnooy Kan, A. H. G. (1991) Machine allocation algorithms for job shop manufacturing.Journal of Intelligent Manufacturing,2, 83–94.

    Google Scholar 

  • Vinod, B. and Solberg, J. J. (1985) Optimal design of flexible manufacturing systems.International Journal of Production Research,23, 1141–51.

    Google Scholar 

  • Walrand, J. (1988)An Introduction to Queueing Networks, Prentice Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  • Wein, L. M. (1988) Scheduling networks of queues: heavy traffic analysis of a two station network with controllable inputs, to appear inOperations Research.

  • Wein, L. M. (1989) Capacity allocation in generalized Jackson networks.Operations Research Letters,8, 143–6.

    Google Scholar 

  • Whitt, W. (1982) Approximations a point process by a renewal process: two basic methods.Operations Research,30, 125–47.

    Google Scholar 

  • Whitt, W. (1983a) The queueing network analyzer.Bell System Technical Journal,62, 2779–815.

    Google Scholar 

  • Whitt, W. (1983b) Performance of the queueing network analyzer.Bell System Technical Journal,62, 2817–43.

    Google Scholar 

  • Whitt, W. (1984a) Approximations for departure processes and queues in series.Naval Research Logistics Quarterly,31, 499–521.

    Google Scholar 

  • Whitt, W. (1984b) Open and closed models for network of queues.ATT Bell Labs Technical Journal,63, 1911–79.

    Google Scholar 

  • Whitt, W. (1985a) Approximations for the GI/G/m queue.unpublished report.

  • Whitt, W. (1985b) Best order for queues in series.Management Science,31, 745–8.

    Google Scholar 

  • Whitt, W. (1987) Approximations for single class departure processes from multi-class queues.Working Paper, AT&T Bell Labs, USA.

    Google Scholar 

  • Whitt, W. (1988) A light traffic approximation for single-class departures from multi-class queues.Management Science,34, 1333–46.

    Google Scholar 

  • Yao, D. D. and Buzacott, J. A. (1987) Modeling a class of flexible manufacturing systems with reversible routing.Operations Research,35, 87–93.

    Google Scholar 

  • Yao, D. D. and Kim, S. C. (1987) Some order relations in closed networks of queues with multiserver stations.Naval Research Logistics Quarterly,34, 53–66.

    Google Scholar 

  • Yao, D. D. and Shanthikumar, J. G. (1987) The optimal input rates to a system of manufacturing cells.INFOR,35, 57–65.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Department, The University of Texas at Austin, Texas, USA

    Panagiotis Kouvelis & Devanath Tirupati

Authors
  1. Panagiotis Kouvelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Devanath Tirupati
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kouvelis, P., Tirupati, D. Approximate performance modeling and decision making for manufacturing systems: A queueing network optimization framework. J Intell Manuf 2, 107–134 (1991). https://doi.org/10.1007/BF01471223

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01471223

Keywords

Search

Navigation