{"title":"A time dependent continuous review inventory model with compound poisson demand","authors":"P. Banerjee, A. Hamidi-Noori, W. Knight","doi":"10.1002/NAV.3800320307","DOIUrl":null,"url":null,"abstract":"We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800320307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
