Skip to main content
SpringerLink
Log in

Capacity planning in manufacturing networks with discrete options

  • Chapter 2 Production Planning And Control
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider multiproduct manufacturing systems modeled by open networks of queues with general distributions for arrival patterns and service times. Since exact solutions are not available for measuring mean number of jobs in these systems, we rely on approximate analyses based on the decomposition approach developed, among others, by Reiser and Kobayashi [16], Kuehn [14], Shanthikumar and Buzacott [19], Whitt [29], and extensions by Bitran and Tirupati [2]. The targeting problem (TP) presented in this paper addresses capacity planning issues in multiproduct manufacturing systems. Since TP is a nonlinear integer program that is not easy to solve, we present a heuristic to obtain an approximate solution. We also provide bounds on the performance of this heuristic and illustrate our approach by means of a numerical example.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. S.L. Albin, Approximating a point process by a renewal process, II: Superposition arrival processes to queues, Oper. Res. 32, 5 (1984) 1133–1162.

    Google Scholar 

  2. G.R. Bitran and D. Tirupati, Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference, Dept. of Mgt. Working Paper #86/87-4-15, The Univ. of Texas at Austin, May, 1987, to appear in Mgt. Sc.

  3. G.R. Bitran and D. Tirupati, Trade-off curves, targeting and balancing in manufacturing networks, WP#87-08-05, IC2 Institute, The University of Texas at Austin, 1987.

  4. J.A. Buzacott and J.G. Shanthikumar, Approximate queueing models of dynamic job shops, Mgt. Sc. 31, 7 (1985) 870–887.

    Google Scholar 

  5. J.A. Buzacott and D.D. Yao, Flexible manufacturing systems: Review of analytical models, Mgt. Sci. 32, 7 (1986) 890–905.

    Google Scholar 

  6. K.M. Chandy, J. Hogarth and C.H. Sauer, Selecting capacities in computer communication systems, IEEE Trans. Software Eng., SE-3, 4 (July 1977) 290–295.

    Google Scholar 

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

    Google Scholar 

  8. Y. Dallery and Y. Frein, An efficient method to determine the optimal configuration of a flexible manufacturing system,Proc. 2nd ORSA/TIMS Conf. on Flexible Manufacturing Systems: Operations Research Models and Their Applications, eds. K.E. Stecke and R. Suri (Elsevier Science, Amsterdam, 1986).

    Google Scholar 

  9. Y.C. Ho, M.A. Eyler and T.T. Chien, A gradient technique for general buffer storage design in a serial production line, Int. Jour. of Prod. Res. 17, 6 (1979) 557–580.

    Google Scholar 

  10. Y.C. Ho, R. Suri, X.R. Cao, G.W. Diehl, J.W. Dille and M. Zazanis, Optimization of large multiclass (non-product form) queueing networks using perturbation analysis, Large Scale Systems 7 (1984) 165–180.

    Google Scholar 

  11. J.R. Jackson, Jobshop like queueing systems, Mgt. Sc. 10, 1 (1963) 131–142.

    Google Scholar 

  12. F.P. Kelly, Networks of queues with customers of different types, JAP 12 (1975) 542–554.

    Google Scholar 

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

    Google Scholar 

  14. P.J. Kuehn, Approximate analysis of general networks by decomposition, IEEE Trans. Comm., COM-27, 1 (1979) 113–126.

    Google Scholar 

  15. A.J. Lemoine, Networks of queues-a survey of equilibrium analysis, Mgt. Sc. 24, 4 (1977) 464–481.

    Google Scholar 

  16. M. Reiser and H. Kobayashi, Accuracy of diffusion approximation for some queueing systems, IBM Jour. of Res. and Dev. 18 (1974) 110–124.

    Google Scholar 

  17. K.C. Sevick, A.I. Levy, S.K. Tripathi and J.L. Zahorjan, Improving approximations of aggregated queueing network systems, Proc. Computer Performance, Modelling, Measurement and Evaluation, 1977.

  18. M. Shaked and J.G. Shanthikumar, Stochastic Convexity and its Applications, Feb. 1987 (to appear in Adv. Appl. Prob. 20 (June 1988).

  19. J.G. Shanthikumar and J.A. Buzacott, Open queueing network models of dynamic job shops, Int. Jour. of Prod. Res. 19, 3 (1981) 255–266.

    Google Scholar 

  20. J.G. Shanthikumar and D.D. Yao, Stochastic monotonicity of the queue lengths in closed queueing networks, Dec. 1985 (to appear in Operations Research).

  21. J.G. Shanthikumar and D.D. Yao, Optimal server allocation in a system of multiserver stations, Dec. 1986 (to appear in Mgt. Sc.).

  22. J.G. Shanthikumar and D.D. Yao, The effect of increasing service rates in a closed queueing network, J. Appl. Probl. 23 (1986) 474–483.

    Google Scholar 

  23. K.E. Stecke and J.J. Solberg, The optimality of unbalancing both work loads and machine group sizes in closed queueing networks of multiserver queues, Oper. Res. 33, 4 (1985) 882–910.

    Google Scholar 

  24. R. Suri, A concept of monotonicity and its characterization for closed queueing networks, Oper. Res. 33, 3 (1985) 606–624.

    Google Scholar 

  25. R. Suri and X.R. Cao, The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times, ACM Perf. Eval. Review 12 (1983) 243–256.

    Google Scholar 

  26. A.N. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, JACM 32, 2 (1985) 445–465.

    Google Scholar 

  27. K.S. Trivedi, R.A. Wagner and T.M. Sigmon, Optimal selection of cpu speed, device capacities and file assignments, JACM 27, 3 (1980) 457–473.

    Google Scholar 

  28. W. Whitt, Approximating point processes by a renewal process: Two basic methods, Oper. Res. 30, 1 (1982) 125–147.

    Google Scholar 

  29. W. Whitt, The queueing network analyzer, Bell System Tech. Jour. 62, 9 (1983) 2779–2815.

    Google Scholar 

  30. W. Whitt, Approximations for the departure processes and queues in series, NRLQ 31 (1984) 499–521.

    Google Scholar 

  31. W. Whitt, Approximations for the GI/G/m queue, Dec. 1985, to appear in AAP.

  32. W. Whitt, A light-traffic approximation for single class departure processes from multi-class queues, May 1987.

  33. D.D. Yao and S.C. Kim, Reducing the congestion in a class of job shops, Jan. 1987.

  34. D.D. Yao and J.G. Shanthikumar, On server allocation in multiple center manufacturing systems, Management Science Working Paper #MS-37, U.C. Berkeley, July 1986.

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sloan School of Management, Massachusetts Institute of Technology, 02139, Cambridge, Mass., U.S.A.

    Gabriel R. Bitran

  2. Department of Management, The University of Texas at Austin, Texas

    Devanath Tirupati

Authors
  1. Gabriel R. Bitran
    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

Bitran, G.R., Tirupati, D. Capacity planning in manufacturing networks with discrete options. Ann Oper Res 17, 119–135 (1989). https://doi.org/10.1007/BF02096601

Download citation

  • Issue Date:

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

Keywords

Search

Navigation