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

•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. In this study, we revisit research contributed by Afzalabadi et al. (2016), wher...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & industrial engineering Ročník 115; s. 37 - 40
Hlavní autoři: Bylka, Stanisław, Krupa, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.01.2018
Témata:
Cheapest path
Discrete time
Inventory control
Periodic demand
Inventory control
Periodic demand
Discrete time
Cheapest path
ISSN:0360-8352
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•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. 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.
ISSN:0360-8352
DOI:10.1016/j.cie.2017.10.031