Skip to main content

A Comparative Study of Periodic-Review Order-Up-To (T, S) Policy and Continuous-Review (s, S) Policy in a Serial Supply Chain Over a Finite Planning Horizon

  • Chapter
  • First Online:
Supply Chain Strategies, Issues and Models

Abstract

In this paper, we consider a serial supply chain (SC) operating with deterministic and known customer demands and costs of review or orders, holding, and backlog at every installation over a finite planning horizon. We present an evaluation of two order policies: Periodic-review order-up-to S policy (i.e., (T, S) policy), and (s, S) policy. We first present a mathematical programming model to determine optimal re-order point and base-stock for every member in the SC. By virtue of the computational complexity associated with the mathematical model, we present genetic algorithms (GAs) to determine the order policy parameters, s and S for every stage. We compare the performances of GAs (for obtaining installation s and S) with the mathematical model for the periodic-review order-up-to (T, S) policy that obtains in its class optimal review periods and order-up-to levels. It is observed that the (s, S) policy emerges to be mostly better than the (T, S) policy.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Axsäter, S. (2006). Inventory control (2nd ed.). Springer: New York.

    Google Scholar 

  • Axsäter, S., & Rosling, K. (1993). Notes: Installation vs. echelon installation stocking policies for multi-level inventory control. Management Science, 39, 1274–1280.

    Article  MATH  Google Scholar 

  • Berry, L. M., Murtagh, B. A., Mcmahon, G. B., Sugden, S. J., & Welling, L. D. (1998). Genetic algorithms in the design of complex distribution networks. International Journal of Physical Distribution and Logistics Management, 28, 377–381.

    Article  Google Scholar 

  • Cheng, C. B., Liu, Z. Y., Chiu, S. W., & Cheng, C. J. (2006). Applying fuzzy logic control to inventory decision in a supply chain. WSEAS Transactions on Systems, 5, 1822–1829.

    Google Scholar 

  • Cheung, K. L., & Zhang, S. H. (2008). Balanced and synchronized ordering in supply chains. IIE Transactions, 40, 1–11.

    Article  Google Scholar 

  • Clark, A. J., & Scarf, H. (1960). Optimal policies for a multi-echelon inventory problem. Management Science, 6, 474–490.

    Article  Google Scholar 

  • Daniel, J. S. R., & Rajendran, C. (2005a). A simulation-based genetic algorithmic approach to inventory optimization in a serial supply chain. International Transactions in Operational Research, 12, 101–127.

    Article  MATH  Google Scholar 

  • Daniel, J. S. R., & Rajendran, C. (2005b). Determination of base-stock levels in a serial supply chain: A simulation-based simulated annealing heuristic. International Journal of Logistics Systems and Management, 1, 149–186.

    Article  Google Scholar 

  • Daniel, J. S. R., & Rajendran, C. (2006). Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives. European Journal of Operational Research, 175, 566–592.

    Article  MATH  Google Scholar 

  • Deo, N. (1999). System simulation with digital computer. New Delhi: Prentice-Hall of India Private Limited.

    Google Scholar 

  • Federgruen, A., & Zipkin, P. (1984). Computational issues in an infinite horizon multi-echelon inventory problem with stochastic demand. Operations Research, 32, 818–836.

    Article  MathSciNet  MATH  Google Scholar 

  • Gallego, G., & Zipkin, P. (1999). Stock positioning and performance estimation in serial production-transportation systems. Manufacturing and Services Operations Management, 1, 77–88.

    Article  Google Scholar 

  • Ganeshan, R., Jack, E., Magazine, M. J., & Stephens, P. (1999). A taxonomic review of supply chain management research. In S. Tayur, et al. (Eds.), Quantitative models for supply chain management (pp. 839–879). Boston, MA: Kluwer Academic Publishers.

    Chapter  Google Scholar 

  • Glasserman, P., & Tayur, S. (1995). A sensitivity analysis for base-stock levels in a multi-echelon production-inventory systems. Management Science, 41, 263–281.

    Article  MATH  Google Scholar 

  • Goldberg, D. E. (1989). Genetic algorithms in search optimization and machine learning. Boston, MA: Addison-Wesley Publishing.

    MATH  Google Scholar 

  • Haq, A. N., & Kannan, G. (2006). Two-echelon distribution-inventory supply chain model for the bread industry using genetic algorithms. International Journal of Logistics Systems and Management, 2, 177–193.

    Google Scholar 

  • Hong, S. P., & Kim, Y. H. (2009). A genetic algorithm for joint replenishment based on the exact inventory cost. Computers & Operations Research, 36, 167–175.

    Article  MathSciNet  MATH  Google Scholar 

  • Johansen, S. G., & Thorstenson, A. (2008). Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times. International Journal of Inventory Research, 1, 44–52.

    Article  Google Scholar 

  • Kumanan, S., Venkatesan, S. P., & Kumar, J. P. (2007). Optimisation of supply chain logistics network using random search techniques. International Journal of Logistics Systems and Management, 3, 252–266.

    Article  Google Scholar 

  • Lee, H. L., & Billington, C. (1992). Managing supply chain inventory: pitfalls and opportunities. Sloan Management Review, 33, 65–72.

    Google Scholar 

  • Lee, H. L., & Billington, C. (1993). Material management in decentralized supply chains. Operations Research, 41, 835–847.

    Article  MATH  Google Scholar 

  • Lee, Y. H., Jeong, C. S., & Moon, C. (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Computers & Industrial Engineering, 43, 351–374.

    Article  Google Scholar 

  • Love, S. F. (1979). Inventory control. New York: McGraw-Hill Book Company.

    Google Scholar 

  • Min, H., & Zhou, G. (2002). Supply chain modeling: past, present and future. Computers & Industrial Engineering, 43, 231–249.

    Article  Google Scholar 

  • Nahmias, S. (2008). Production and operations analysis (6th ed.). New York: McGraw-Hill.

    Google Scholar 

  • Petrovic, D., Roy, R., & Petrovic, R. (1998). Modeling and simulation of a supply chain in an uncertain environment. European Journal of Operational Research, 109, 299–309.

    Article  MATH  Google Scholar 

  • Rom, W. O., & Slotnick, S. A. (2009). Order acceptance using genetic algorithms. Computers & Operations Research, 36, 1758–1767.

    Article  MATH  Google Scholar 

  • Sethupathi, P. V. R., & Rajendran, C. (2010). Optimal and heuristic base-stock levels and review periods in a serial supply chain. International Journal of Logistics Systems and Management, 7, 133–164.

    Article  Google Scholar 

  • Shang, K. H., & Song, J. S. (2003). Newsvendor bounds and heuristic for optimal inventory policies in serial supply chains. Management Science, 49, 618–638.

    Article  MATH  Google Scholar 

  • Shang, K. H., & Song, J. S. (2007). Serial supply chains with economies of scale: bounds and approximations. Operations Research, 55, 843–853.

    Article  MathSciNet  MATH  Google Scholar 

  • Silver, E., Pyke, D. F., & Peterson, R. (1998). Inventory management and production planning and scheduling (3rd ed.). New York: John Wiley and Sons.

    Google Scholar 

  • van Houtum, G. J., Scheller-Wolf, A., & Yi, J. (2007). Optimal control of serial inventory systems with fixed replenishment intervals. Operations Research, 55, 674–687.

    Article  MathSciNet  MATH  Google Scholar 

  • Wang, Q. (2011). Control policies for multi-echelon inventory systems with stochastic demand. In T.-M. Choi & T. C. E. Cheng (Eds.), Supply chain coordination under uncertainty (pp. 83–108). Berlin: Springer.

    Chapter  Google Scholar 

  • Zhou, G., Min, H., & Gen, M. (2002). The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach. Computers & Industrial Engineering, 43, 251–261.

    Article  Google Scholar 

  • Zipkin, P. (2000). Foundations of inventory management. New York: McGraw-Hill.

    Google Scholar 

Download references

Acknowledgments

The authors thank the two reviewers for their suggestions to improve the paper. The second author gratefully acknowledges the Alexander von Humboldt Foundation for supporting him to carry out a part of this work at the University of Passau.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. V. Rajendra Sethupathi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag London

About this chapter

Cite this chapter

Sethupathi, P.V.R., Rajendran, C., Ziegler, H. (2014). A Comparative Study of Periodic-Review Order-Up-To (T, S) Policy and Continuous-Review (s, S) Policy in a Serial Supply Chain Over a Finite Planning Horizon. In: Ramanathan, U., Ramanathan, R. (eds) Supply Chain Strategies, Issues and Models. Springer, London. https://doi.org/10.1007/978-1-4471-5352-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5352-8_6

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5351-1

  • Online ISBN: 978-1-4471-5352-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics