A note on the Optimal Periodic Pattern (OPP) algorithm for the system in which buyers periodically order from a vendor. (January 2018)

• Record Type: Journal Article
• Authors: Bylka, Stanisław; Krupa, Andrzej
• Is Part Of: Computers & industrial engineering. Volume 115(2018)
• Page Start: 37
• Page End: 40
• Publication Date: 2018-01
• Subjects: Inventory control -- Periodic demand -- Discrete time -- Cheapest path; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2017.10.031
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: We revisit research contributed by Afzalabadi et al. (2016). For the algorithm two counterexamples with appropriate comments are presented. We provide conditions for optimal ordering policy in the periodic demand case. Abstract: In this study, we revisit research contributed by Afzalabadi et al. (2016), where a lot size problem for discrete periodic demand case was considered. Our note indicates incorrectness of the main thesis that the OPP algorithm finds the optimal solution in a finite number of steps. Numerical counterexamples with appropriate comments are presented. We also provide a reformulation of the model and proper conditions for optimality.