Stochastic economic lot scheduling problem: heavy traffic analysis of dynamic cyclic policies

Operations Research

Volumn 48, Issue 1, 2000, Pages 136-154

  Markowitz, David M ^a   Reiman, Martin I ^a   Wein, Lawrence M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; DYNAMIC PROGRAMMING; INDUSTRIAL ECONOMICS; INVENTORY CONTROL; PROBLEM SOLVING; PRODUCTION CONTROL; QUEUEING THEORY;

DYNAMIC CYCLIC POLICIES; DYNAMIC LOT SIZING POLICY; ECONOMIC LOT SCHEDULING PROBLEM; SETUP COST PROBLEM;

SCHEDULING;

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

References (33)

1. Anupindi, R., S. Tayur. 1998. Managing stochastic multi-product systems: model, measures, and analysis. Oper. Res. 46 S98-S111.
2. Beneš, V. E., L. A. Shepp, H. S. Witsenhausen. 1980. Some solvable stochastic control problems. Stochastics 4 39-83.
3. Bourland, K. E., C. A. Yano. 1995. The strategic use of capacity slack in the economic lot scheduling problem with random demand. Management Sci. 40 1690-1704.
4. Coffman, E. G., Jr., A. A. Puhalskii, M. I. Reiman. 1995. Polling systems with zero switchover times: a heavy-traffic averaging principle. Ann. Appl Probab. 5 681-719.
5. _,_,_. 1998. Polling systems in heavy-traffic: a Bessel process limit. Math. Oper. Res. 23 257-304.
6. Cox, D. R., W. L. Smith. 1961. Queues. Methunen, London, UK.
7. Dobson, G. 1987. The economic lot scheduling problem -achieving feasibility using time-varying lost sizes. Oper. Res. 35 764-771.
8. Elmaghraby, S. E. 1978. The economic lot scheduling problem (ELSP): review and extensions. Management Sci. 24 587-598.
9. Federgruen, A., Z. Katalan. 1995. Determining production schedules under base-stock policies in single facility multi-item production systems. To appear in Oper. Res.
10. _,_. 1996. The stochastic economic lot scheduling problem: cyclical base-stock policies with idle times. Management Sci. 42 783-796.
11. Gallego, G. 1990. Scheduling the production of several items with random demands in a single facility. Management Sci. 36 1579-1592.
12. _, D. Joneja. 1994. Economic lot scheduling problem with raw material consideration. Oper. Res. 42 92-101.
13. Graves, S. C. 1980. The multi-product production cycling problem. AIIE Trans. 12 233-240.
14. Harrison, J. M. 1985. Brownian Motion and Stochastic Flow Systems. John Wiley, New York.
15. Hofri, M., K. W. Ross. 1987. On the optimal control of two queues with server set-up times and its analysis. SIAM J. Comput. 16 399-420.
16. Hsu, W. 1985. On the general feasibility test of scheduling lot sizes for several products on one machine. Management Sci. 29 93-105.
17. Iglehart, D. L., W. Whitt. 1970. Multiple channel queues in heavy traffic, I and II. Adv. in Appl. Probab. 2 150-177, 355-364.
18. Kushner, H. J., P. G. Dupuis. 1992. Numerical Methods for Stochastic Control Problems in Continuous Time. Springer-Verlag, New York.
19. Leachman, R. C., A. Gascon. 1988. A heuristic scheduling policy for multi-item, single machine production systems with time-varying stochastic demands. Management Sci. 34 377-390.
20. Mandl, P. 1968. Analytical Treatment of One-Dimensional Markov Processes. Springer-Verlag, New York.
21. Markowitz, D. M. 1996. A unified approach to single machine scheduling: heavy traffic analysis of dynamic cyclic policies. Ph.D. Thesis. Operations Research Center, MIT, Cambridge, MA.
22. _, M. I. Reiman, L. M. Wein. 1997. The stochastic economic lot scheduling problem: heavy traffic analysis of dynamic cyclic policies. Sloan School of Management, MIT, Cambridge, MA.
23. _, L. M. Wein. 1996. Heavy traffic analysis of dynamic cyclic policies: a unified approach to single machine scheduling. To appear in Oper. Res.
24. Morse, P. 1958. Queues, Inventories and Maintenance. John Wiley, New York.
25. Qiu, J., R. Loulou. 1995. Multiproduct production/inventory control under random demands. IEEE Trans. Automatic Control 40 350-356.
26. Reiman, M. I. 1984. Open queueing networks in heavy traffic. Math. Oper. Res. 9 441-458.
27. _. 1988. A multiclass feedback queue in heavy traffic. Adv. Appl. Probab. 20 179-207.
28. _, L. M. Wein. 1998. Dynamic scheduling of a two-class queue with setups. Oper. Res. 46 532-547.
29. Sethi, S. P., Q. Zhang. 1995. Hierarchical production and setup scheduling in stochastic manufacturing systems. IEEE Trans. Automatic Control 40 924-930.
30. Sharifnia, A., M. Caramanis, S. B. Gershwin. 1991. Dynamic setup scheduling and flow control in manufacturing systems. Discrete Event Dynamic Systems: Theory and Appl. 1 149-175.
31. Sox, C. R., J. A. Muckstadt. 1997. Optimization-based planning for the stochastic lot scheduling problem. IIE Trans. 29 349-358.
32. Wein, L. M. 1992. Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40 724-735.
33. Zipkin, P. 1991. Computing optimal lot sizes in the economic lot scheduling problem. Oper. Res. 39 56-63.