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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 115; S. 37 - 40
Hauptverfasser: Bylka, Stanisław, Krupa, Andrzej
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.01.2018
Schlagworte:
Cheapest path
Discrete time
Inventory control
Periodic demand
Inventory control
Periodic demand
Discrete time
Cheapest path
ISSN:0360-8352
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•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