Production allocation optimization by combining distribution free approach with open queueing network theory

详细信息    查看全文

• 作者：Yasuhiko Takemoto (1) ys-take@pu-hiroshima.ac.jp
  Ikuo Arizono (2) arizono@et6500.mech.okayama-u.ac.jp
• 关键词：Distribution free approach &#8211 ; Expectation and variance of lead time &#8211 ; Open queueing network &#8211 ; Production allocation &#8211 ; Tardiness cost
• 刊名：The International Journal of Advanced Manufacturing Technology
• 出版年：2012
• 出版时间：November 2012
• 年：2012
• 卷：63
• 期：1-4
• 页码：349-358
• 全文大小：303.6 KB
• 参考文献：1. Benjaafar S, Gupta D (1999) Workload allocation in multi-product, multi-facility production systems with setup times. IIE Trans 31(4):339–352
  2. Bitran GR, Dasu S (1992) A review of open queueing network models of manufacturing systems. Queueing Syst 12(1–2):95–133
  3. Bitran GR, Morabito R (1996) Open queueing networks: Optimization and performance evaluation models for discrete manufacturing systems. Prod Oper Manag 5(2):163–193
  4. Bitran GR, Tirupati D (1988) Multiproducts queueing networks with deterministic routing: decomposition approach and the notation of interference. Manag Sci 34(1):75–100
  5. Borst SC (1995) Optimal probabilistic allocation of customer types to servers. ACM SIGMETRICS Perf Eval Rev 23(1):116–125
  6. Bretthauer KM (2000) Optimal service and arrival rate in jackson queueing networks. Nav Res Logist 47(1):1–17
  7. Buzacott J, Shanthikumar J (1993) Stochastic models of manufacturing systems. Prentice Hall, Englewood Cliffs
  8. Calabrese JM (1992) Optimal workload allocation in open networks of multiserver queues. Manag Sci 38(12):1792–1802
  9. Combe MB, Boxma OJ (1994) Optimization of static traffic allocation policies. Theor Comp Sci 125(1):17–43
  10. Fletcher R (1987) Practical Methods of Optimization. John Wiley
  11. Graham R, Grotschel M, Lovasz L (1985) Handbook of combinatorics I/II. Elsevier
  12. Georgiadis L, Nikolaou C, Thomasian A (2004) A fair workload allocation policy for heterogeneous systems. J Parallel Distrib Comput 64(4):507–519
  13. Govil MK, Fu MC (1999) Queueing theory in manufacturing: a review. J. Manuf Syst 18(4):214–240
  14. Guo X, Lu Y, Squillante, M. S. (2004) Optimal probabilistic routing in distributed parallel queues. ACM SIGMETRICS Perf Eval Rev 32(2), 53-54.
  15. Koole, G. (1999) On the static assignment to parallel servers. IEEE Trans Automat Contr 44(8), 1588–1592.
  16. Menich R, Serfozo R (1991) Optimality of routing and servicing in dependent parallel processing systems. Queueing Syst 9(4):403–418
  17. Moon I, Gallego G (1994) Distribution free procedures for some inventory models. The Int J Oper Res 46(6):651–658
  18. Shanthikumar JG, Buzacott JA (1984) The time spent in a dynamic job shop. Eur J Oper Res 17(2):215–226
  19. Souza GC, Ketzenberg ME (2002) Two-stage make- to-order remanufacturing with service-level constraints. Int J Prod Res 40(2):477–493
  20. Souza GC, Ketzenberg ME, Guide VDR (2002) Capacitated remanufacturing with service level constraints. Prod Oper Manag 11(2):231–248
  21. Tang CS, Van VM (1994) Traffic allocation for manufacturing systems. Eur J Oper Res 75(1):171–185
  22. Vandaele N, De Boeck L, Callewier D (2002) An open queueing network for leadtime analysis. IIE Trans 34(1):1–9
  23. Walrand J (1988) An introduction to queueing networks. Prentice-Hall International
  24. Weng ZK (1999) Strategies for integrating lead time and customer-order decisions. IIE Trans 31(2):161–171
  25. Whitt W (1983) Queueing network analyzer. Bell Syst Tech J 62(9):2779–2815
  26. Whitt W (1983) Performance of the queueing network analyzer. Bell Syst Tech J 62(9):2817–2843
  27. Winston W (1978) Optimality of the shortest line discipline. J Appl Prob 14:181–189
• 作者单位：1. Faculty of Management and Information Systems, Prefectural University of Hiroshima, Hiroshima, 734-8558 JAPAN2. Graduate School of Natural Science and Technology, Okayama University, Okayama, 700-8530 JAPAN
• ISSN：1433-3015

文摘

We consider production allocation in a discrete manufacturing system formulated as an open queueing network (OQN) composed of some GI/G/1 queueing systems. The lead time performance, such as expectation and variance, in the manufacturing system has been analyzed and discussed using the OQN theory in the previous works. Through the improvement of lead time performance, we can discuss the decrease of the tardiness cost for delivery in the manufacturing system. Then, although the distribution of lead time is frequently required in order to evaluate the tardiness cost for delivery, it is difficult to understand the distribution of lead time exactly. In this article, we have a challenge of assessing the tardiness cost by using only the limited information, such as the expectation and variance of lead time. Concretely, we evaluate the upper bound of tardiness cost by combining the distribution free approach (DFA) with the OQN analysis. Then, a new optimal allocation policy for the production and tardiness costs is proposed.