Determining production schedules under base-stock policies in single facility multi-item production systems

Operations Research

Volumn 46, Issue 6, 1998, Pages 883-898

  Federgruen, Awi ^a   Katalan, Ziv ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Inventory production: multi item echeon stage; Inventory production: stochastic; Production scheduling: stochastic

Indexed keywords

HEURISTIC METHODS; INVENTORY CONTROL; MATHEMATICAL PROGRAMMING; PRODUCTION; PUBLIC POLICY;

BASE STOCK POLICIES; PERIODIC ITEM SEQUENCE; STOCHASTIC ECONOMIC LOT SCHEDULING PROBLEMS;

SCHEDULING;

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

References (52)

1. ANUPINDI, R., AND S. TAYUR. 1998. Managing Stochastic Multi-product Systems: Models, Measures and Analysis. Op. Res. 46, S98-S111.
2. BERTSIMAS, D., AND J. NIÑO-MORA. 1993. Conservation Laws, Extended Polymatroids and Multi-armed Bandit Problems: A Unified Polyhedral Approach. Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization, 355-385.
3. BERTSIMAS, D., I. PASCHALIDIS, AND J. TSITSIKLIS. 1994. Optimization of Multiclass Queueing Networks: Polyhedral and Nonlinear Characterizations of Achievable Performance. to appear in Annals of Applied Probability.
4. BERTSIMAS, D., AND H. XU. 1993. Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks. Working Paper, Sloan School of Management and Operations Research Center, MIT, Cambridge, MA.
5. BHATTACHARYA, P. P., L. GEORGIADIS, AND P. TSOUCAS. 1991. Extended Polymatroids: Properties and Optimization. Proceedings of International Conference on Integer Programming and Combinatorial Optimization. Carnegie Mellon University, Mathematical Programming Society, 298-315.
6. BOURLAND, K. E., AND C. A. YANO. 1991. Modeling Random Demand when the Exposure Period Is a Decision Variable. Working Paper No. 270, The Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
7. BOURLAND, K. E., AND C. A. YANO. 1994. The Strategic Use of Capacity Slack in the Economic Lot Scheduling Problem with Random Demand, Mgmt. Sci. 40, 1690-1704.
8. BOXMA, O. J., H. LEVY, AND J. A. WESTSTRATE. 1990. Optimization of Polling Systems. In Performance 90, P. J. B. King, I. Mitrani, and R. J. Pooley (eds.). Elsevier Science Publishers B.V., North Holland.
9. BOXMA, O. J., H. LEVY, AND J. A. WESTSTRATE. 1991. Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. Queueing Systems, 9, 133-162.
10. BOXMA, O. J., H. LEVY, AND J. A. WESTSTRATE. 1993. Efficient Visit Orders for Polling Systems. Performance Evaluation, 18, 103-123.
11. BROWNE, S., AND U. YECHIALI. 1989a. Dynamic Routing in Polling Systems. Teletraffic Science for New Cost-Effective Systems, Networks and Services, ITC-12. M. Bonatti (ed.), Elsevier Science Publishers, North Holland, Amsterdam, 1455-1466.
12. BROWNE, S., AND U. YECHIALI. 1989b. Dynamic Priority Rules for Cyclic-type Queues. Advances in Applied Probability. 21, 2, 432-450.
13. CHOUDHURY, G. L., AND W. WHITT. 1994. Computing Transient and Steady-state Distributions in Polling Models by Numerical Transform Inversion. Working Paper, AT&T Bell Laboratories, Holmdel, NJ.
14. COFFMAN, E., AND I. MITRANI. 1980. A Characterization of Waiting Time Performance Realizable by Single Server Queues. Opns. Res. 28, 810-821.
15. DODSON, G. 1987. The Economic Lot Scheduling Problem: Achieving Feasibility Using Time-varying Lot Sizes. Opns. Res. 35, 5, 764-771.
16. DUENYAS, I., AND M. P. VAN OYEN. 1995. Stochastic Scheduling of Parallel Queues with Setup Costs. Queueing Systems, 19, 421-444.
17. DUENYAS, I., AND M. P. VAN OYEN. 1996. Heuristic Scheduling of Parallel Heterogeneous Queues with Setups. Mgmt. Sci. 42, 814-829.
18. FEDERGRUEN, A., AND H. GROENEVELT. 1988a. Characterization and Optimization of Achievable Performance in General Queueing Systems. Opns. Res. 36, 736-741.
19. FEDERGRUEN, A., AND H. GROENEVELT. 1988b. M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control Achievable Performance under Nonpreemptive Priority Rules. Mgmt. Sci. 34, 1121-1138.
20. FEDERGRUEN, A., AND Z. KATALAN. 1994. Approximating Queue Size and Waiting Time Distributions in General Polling Systems. Queueing Systems, 18, 353-386.
21. FEDERGRUEN, A., AND Z. KATALAN. 1995. Make-to-Stock or Make to Order: That is the Question; Novel Answers to an Ancient Debate. Working Paper, Graduate School of Business, Columbia University, New York, NY.
22. FEDERGRUEN, A., AND Z. KATALAN. 1996a. The Stochastic Economic Lot Scheduling Problem: Cyclical Base-stock Policies with Idle Times. Mgmt. Sci. 42, 783-796.
23. FEDERGRUEN, A., AND Z. KATALAN. 1996b. The Impact of Setup Times on the Performance of Multi-class Service and Production Systems. Opns. Res. 44, 989-1001.
24. FOX, B. 1958. Discrete Optimization via Marginal Analysis. Mgmt. Sci. 4, 136-153.
25. FREDERICKSON, G. N., AND D. B. JOHNSON. 1982. The Complexity of Selection and Ranking in X + Y and Matrices with Sorted Columns. J. Comput. Sys. Sci. 197-208.
26. FUHRMANN, S. W., AND R. B. COOPER. 1985. Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations. Opns. Res. 33, 5, 1117-1129.
27. GALIL, Z., AND N. MEGIDDO. 1979. A Fast Selection Algorithm and the Problem of Optimum Distribution of Efforts. J. ACM, 26, 58-64.
28. GALLEGO, G., AND I. MOON. 1993. The Distribution Free Newsboy Problem: Review and Extensions. J. Opl. Res. Soc. 44, 825-834.
29. GALLEGO, G. 1998. New Bounds and Heuristics for (Q, r) Policies. Mgmt. Sci. 44, 219-233.
30. GROENEVELT, H. 1986. Resource Allocation Problems with Decreasing Marginal Returns to Scale, Ph.D. Dissertation, Columbia University, New York, NY.
31. GROSS, O. 1956. A Class of Discrete-type Minimization Problems. Working Paper, RM-1644-PR, The Rand Corporation, Santa Monica, CA.
32. HA, A. 1992. Optimal Scheduling and Stock Rationing Policies in Make-to-stock Production Systems. Ph.D. Dissertation, Stanford University, Stanford, CA.
33. KATEHAKIS, M. N., AND A. F. VEINOTT. 1987. The Multiarmed Bandit Problem: Decomposition and Computation. Math. O. R. 12, 262-268.
34. KLEINROCK, L., AND H. LEVY. 1988. The Analysis of Random Polling Systems. Opns. Res. 36, 716-732.
35. KLINCEWICZ, J. G., AND W. WHITT. 1984. On Approximation for Queues, II: Shape Constraints. AT&T Bell Laboratories Technical J. 63, 139-161.
36. KNUTH, D. E. 1973. The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, MA.
37. KONHEIM, A. G., H. LEVY, AND M. M. SRINIVASAN. Descendant Set: An Efficient Approach for the Analysis of Polling Systems. IEEE Trans. Communications, 42, 2/3/4, 1245-1253.
38. LEACHMAN, R. C., AND A. GASCON. 1988. A Heuristic Scheduling Policy for Multi-item, Single-machine Production Systems with Time-varying Stochastic Demands. Mgmt. Sci. 34, 3, 377-390.
39. LEACHMAN, R. C., Z. K. XIONG, A. GASCON, AND K. PARK. 1991. Note: An Improvement to the Dynamic Cycle Lengths Heuristic for Scheduling the Multi-item, Single Machine. Mgmt. Sci. 37, 9, 1201-1205.
40. MARKOWITZ, D. M., M. I. REIMAN, AND L. M. WEIN. 1995. The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies. Working Paper, Operations Research Center, MIT, Cambridge, MA.
41. QUI, J., AND R. LOULOU. 1995. Multiproduct Production Inventory Control under Random Demands. IEEE Trans. Automatic Control, 40, 350-356.
42. SARKAR, D., AND W. I. ZANGWILL. 1991. Variance Effects in Cyclic Production Systems. Mgmt. Sci. 37, 444-453.
43. SCARF, H. 1958. A Min-Max Solution of an Inventory Problem. In Studies in the Mathematical Theory of Inventory and Production. Stanford University Press.
44. SHANTHIKUMAR, G., AND D. D. YAO. 1992. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control. Opns. Res. 40, Supplement 2, S293-299.
45. TAKAGI, H. 1986. Analysis of Polling Systems. MIT Press, Cambridge, MA.
46. TAYUR, S. 1994. A JIT Implementation at a Laminate Plant: Some New Insights. Working Paper, GSIA, Carnegie Mellon University, Pittsburgh, PA.
47. TIJMS, H. C. 1986. Stochastic Modeling and Analysis: A Computational Approach. John Wiley & Sons, Great Britain.
48. ZANGWILL, W. I. 1992. The Limits of Japanese Production Theory. Interfaces, 22, 14-25.
49. ZANGWILL, W. I. 1994. Comments on "The Limits of Japanese Production Theory." Interfaces, 24, 77-94.
50. ZIPKIN, P. 1982. Exact and Approximate Cost Functions for Product Aggregates. Mgmt. Sci. 28, 1002-1012.
51. ZIPKIN, P. 1986. Models for Design and Control of Stochastic, Multi-item Batch Production Systems. Opns. Res. 34, 1, 91-104.
52. ZIPKIN, P. 1991. Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem. Opns. Res. 39, 1, 56-63.