combine@alvar.ug

Joint Replenishment Problem in Drug Inventory Management of Pharmacies under Stochastic Demand

Joint Replenishment Problem in Drug Inventory Management of Pharmacies under Stochastic Demand

Show simple record

dc.contributor.author Kizito Paul Mubiru
dc.date.accessioned 2021-01-10T11:55:34Z
dc.date.available 2021-01-10T11:55:34Z
dc.date.issued 2018
dc.identifier.issn 22378960
dc.identifier.uri https://combine.alvar.ug/handle/1/48957
dc.description.abstract In today’s fast-paced and competitive market place, organizations need every edge available to them to ensure success in planning and managing inventory of items with demand uncertainty. In such an effort, cost effective methods in determining optimal replenishment policies are paramount. In this paper, a mathematical model is proposed that optimize inventory replenishment policies of a periodic review inventory system under stochastic demand; with particular focus on malaria drugs in Ugandan pharmacies. Adopting a Markov decision process approach, the states of a Markov chain represent possible states of demand for drugs that treat malaria. Using weekly equal intervals, the decisions of whether or not to replenish additional units of drugs were made using discrete time Markov chains and dynamic programming over a finite period planning horizon. Empirical data was collected from two pharmacies in Uganda. The customer transactions of drugs were taken on a weekly basis; where data collected was analyzed and tested to establish the optimal replenishment policy and inventory costs of drugs. Results from the study indicated the existence of an optimal state-dependent replenishment policy and inventory costs of drugs at the respective pharmacies.
dc.publisher Associacao Brasileira de Engenharia de Producao - ABEPRO
dc.relation.ispartof Brazilian Journal of Operations & Production Management
dc.title Joint Replenishment Problem in Drug Inventory Management of Pharmacies under Stochastic Demand
dc.type journal article
dc.identifier.doi 10.14488/bjopm.2018.v15.n2.a12
dc.identifier.mag 2807160460
dc.identifier.lens 004-971-473-647-865
dc.identifier.volume 15
dc.identifier.issue 2
dc.identifier.spage 302
dc.identifier.epage 310
dc.subject.lens-fields Pharmacy
dc.subject.lens-fields Markov decision process
dc.subject.lens-fields Perfect competition
dc.subject.lens-fields Time horizon
dc.subject.lens-fields Inventory management
dc.subject.lens-fields Dynamic programming
dc.subject.lens-fields Computer science
dc.subject.lens-fields Operations research
dc.subject.lens-fields Discrete time and continuous time
dc.subject.lens-fields Markov chain


This record appears in the collections of the following institution(s)

Show simple record

Search Entire Database


Browse

My Account