Skip to main content
Log in

Dynamic resource allocation in a multi-product make-to-stock production system

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider optimal policies for a production facility in which several (K) products are made to stock in order to satisfy exogenous demand for each. The single machine version of this problem in which the facility manufactures at most one product at a time to minimise inventory costs has been much studied. We achieve a major generalisation by formulating the production problem as one involving dynamic allocation of a key resource which drives the manufacture of all products under an assumption that each additional unit of resource allocated to a product achieves a diminishing return of increased production rate. A Lagrangian relaxation of the production problem induces a decomposition into K single product problems in which the production rate may be varied but is subject to charge. These reduced problems are of interest in their own right. Under mild conditions of full indexability the Lagrangian relaxation is solved by a production policy with simple index-like structure. This in turn suggests a natural index heuristic for the original production problem which performs strongly in a numerical study. The paper discusses the importance of full indexability and makes proposals for the construction of production policies involving resource idling when it fails.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ata, B., Shnoerson, S.: Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Manag. Sci. 52, 1778–1793 (2006)

    Article  Google Scholar 

  2. de Vericourt, F., Karaesman, F., Dallery, Y.: Dynamic scheduling in a make-to-stock system: a partial characterization of optimal policies. Oper. Res. 48(5), 811–819 (2000)

    Article  Google Scholar 

  3. Gavish, B., Graves, S.C.: A one-product production/inventory problem under continuous review policy. Oper. Res. 28(5), 1228–1236 (1980)

    Article  Google Scholar 

  4. Glazebrook, K.D., Kirkbride, C., Ouenniche, J.: Index policies for the admission control and routing of impatient customers to heterogeneous service stations. Oper. Res. 57, 975–989 (2009)

    Article  Google Scholar 

  5. Glazebrook, K.D., Hodge, D.J., Kirkbride, C.: General notions of indexability for queueing control and asset management. Ann. Appl. Probab. (2011). doi:10.1214/10-AAP705

    Google Scholar 

  6. Ha, A.Y.: Optimal dynamic scheduling policy for a make-to-stock production system. Oper. Res. 45(1), 42–53 (1997)

    Article  Google Scholar 

  7. Menich, R., Serfozo, R.F.: Optimality of routing and servicing in dependent parallel processing systems. Queueing Syst. 9(4), 403–418 (1991)

    Article  Google Scholar 

  8. Niño-Mora, J.: Restless bandits, partial conservation laws and indexability. Adv. Appl. Probab. 33, 76–98 (2001)

    Article  Google Scholar 

  9. Niño-Mora, J.: Restless bandit marginal productivity indices, diminishing returns, and optimal control of make-to-order/make-to-stock M/G/1 queues. Math. Oper. Res. 31(1), 50–84 (2006)

    Article  Google Scholar 

  10. Perez, A.P., Zipkin, P.: Dynamic scheduling rules for a multi-product make-to-stock queue. Oper. Res. 45(6), 919–930 (1997)

    Article  Google Scholar 

  11. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994)

    Google Scholar 

  12. Sobel, M.: Optimal average cost policy for a queue with start-up and shut-down costs. Oper. Res. 17, 145–162 (1969)

    Article  Google Scholar 

  13. Sobel, M.: The optimality of full-service policies. Oper. Res. 30, 636–649 (1982)

    Article  Google Scholar 

  14. Tijms, H.: Stochastic Models: An Algorithmic Approach. Wiley, New York (1994)

    Google Scholar 

  15. Veatch, M.H., Wein, L.M.: Scheduling a make-to-stock queue: index policies and hedging points. Oper. Res. 44(4), 634–647 (1996)

    Article  Google Scholar 

  16. Weber, R.R., Weiss, G.: On an index policy for restless bandits. J. Appl. Probab. 27, 637–648 (1990)

    Article  Google Scholar 

  17. Wein, L.M.: Dynamic scheduling of a multi-class make-to-stock queue. Oper. Res. 40(4), 724–735 (1992)

    Article  Google Scholar 

  18. Whittle, P.: Restless bandits: Activity allocation in a changing world. J. Appl. Probab. 25, 287–298 (1988)

    Article  Google Scholar 

  19. Zheng, Y.-S., Zipkin, P.: A queueing model to analyze the value of centralized inventory information. Oper. Res. 38(2), 296–307 (1990)

    Article  Google Scholar 

  20. Zipkin, P.: Performance analysis of a multi-item production-inventory system under alternative policies. Manag. Sci. 41(4), 690–703 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. J. Hodge.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hodge, D.J., Glazebrook, K.D. Dynamic resource allocation in a multi-product make-to-stock production system. Queueing Syst 67, 333–364 (2011). https://doi.org/10.1007/s11134-011-9217-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-011-9217-2

Keywords

Mathematics Subject Classification (2000)

Navigation