Probabilistic service level guarantees in make-to-stock manufacturing systems

Operations Research

Volumn 49, Issue 1, 2001, Pages 119-133

  Bertsimas, Dimitris ^a   Paschalidis, Ioannis Ch ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COSTS; DECISION THEORY; INVENTORY CONTROL; PROBABILISTIC LOGICS; PRODUCTION CONTROL; PUBLIC POLICY;

FINISHED GOODS INVENTORY (FGI);

PROCESS CONTROL;

EID: 0034999406     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.1.119.11183     Document Type: Article

References (31)

1. Avram, F., D. Bertsimas, M. Ricard. 1995. Optimization of multiclass fluid queueing networks: a linear control approach. Proceedings of the IMA (F. P. Kelly and R. Williams, eds.), 199-234.
2. Abate, J., G. L. Choudhury, W. Whitt. 1995. Exponential approximations for tail probabilities in queues, I: Waiting times. Oper. Res. 43 (5) 885-901.
3. Akella, R., P. R. Kumar. 1986. Optimal Control of production rate in a failure prone manufacturing system. IEEE Trans. Automat Control AC-31 116-126.
4. Bertsekas, D. P. 1995. Dynamic Programming and Optimal Control, vol. I. Athena Scientific, Belmont, MA.
5. Bertsimas, D., I. Ch. Paschalidis, J. N. Tsitsiklis. 1998a. Asymptotic buffer overflow probabilities in multiclass multiplexers: An optimal control approach. IEEE Trans. Automat. Control 43 (3) 315-335.
6. _, _, _. 1998b. On the large deviations behaviour of acyclic networks of G/G/1 queues. The Ann. Appl. Probab. 8 (4) 1027-1069.
7. _, _, _. 1999. Large deviations analysis of the generalized processor sharing policy, Queueing Systems 32 319-349.
8. Cramér, H. 1938. Sûr un nouveau théorème-limite de la théorie des probabilités, In Actualiés Scientifique et Industrielles, no. 736 in Colloque consacré à la théorie des probabilités, pages 5-23, Hermann, Paris.
9. de Véricourt, F., F. Karaesmen, Y. Dallery. 1998. Dynamic scheduling in a make-to-stock system: A partial characterization of optimal policies, Oper. Res. 48 (5) 811-819.
10. Dembo, A., O. Zeitouni. 1993. Large Deviations Techniques and Applications. Jones and Bartlett, Boston, MA.
11. Evans, R. 1967. Inventory control of a multiproduct system with a limited production resource. Naval Res. Logist. 173-184.
12. Federgruen, A., P. Zipkin. 1986. An inventory model with limited production capacity and uncertain demands I. The average cost criterion. Math. Oper. Res. 11 (2) 193-207.
13. Gavish, B., S. Graves. 1980. A one-product production/inventory problem under continuous review policy. Oper. Res. 28 1228-1236.
14. Glasserman, P. 1996. Allocating production capacity among multiple products. Oper. Res. 44 (5) 724-734.
15. _. 1997. Bounds and asymptotics for planning critical safety stocks. Oper. Res. 45 (2) 244-257.
16. _, Y. Wang. 1998. Fill-rate bottlenecks in production-inventory networks. Working paper.
17. Glynn, P. W., W. Whitt. 1994. Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Probab. 31A 131-156.
18. Ha, A.Y. 1997. Optimal dynamic scheduling policy for a make-to-stock production system. Oper. Res. 45 (1) 42-53.
19. Krämer, W., M. Langenbach-Belz. 1976. Approximate formulae for the delay in the queueing system GI/G/1. Proceedings 8th International Teletraffic Congress (Melbourne).
20. Kapuscinski, R., S. R. Tayur. 1999. Optimal policies and simulation based optimization for capacitated production inventory systems. S. R. Tayur, R. Ganeshan, and M. Magazine, eds. Quantitative Models for Supply Chain Management. Kluwer, The Netherlands, 7-40.
21. Meyn, S. P. 1996. Stability and optimization of queueing networks and their fluid models, Proceedings of the Summer Seminar on The Mathematics of Stochastic Manufacturing Systems (Williamsburg, VA) 17-21.
22. Paschalidis, I. Ch. 1996. Large deviations in high speed communication networks. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA.
23. _. 1998. A multiclass queue under the generalized longest queue first policy: Bounds on the overflow probabilities. Unpublished manuscript.
24. Peña Perez, A., P. Zipkin. 1997. Dynamic scheduling rules for a multiproduct make-to-stock queue. Oper. Res. 45 (6) 919-930.
25. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
26. Sobel, M. 1982. The optimality of full-service policies. Oper. Res. 30 636-649.
27. Spearman, M. L., R. Q. Zhang. 1999. Optimal lead time policies. Management Sci. 45 (2) 290-295.
28. Tijms, H. C., 1986. Stochastic Modelling and Analysis: A Computational Approach. Wiley, New York.
29. Veatch, M. H., L. M. Wein. 1996. Scheduling a make-to-stock queue: Index policies and hedging points. Oper. Res. 44 (4) 643-647.
30. Wein, L. M., 1992. Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40 724-735.
31. Zheng, Y.-S., P. Zipkin. 1990. A queueing model to analyze the value of centralized inventory information. Oper. Res. 38 (2) 296-307.