{"title":"Investing in reducing lead-time randomness in continuous-review inventory models","authors":"Yigal Gerchak, Mahmut Parlar","doi":"10.1016/0167-188X(91)90032-W","DOIUrl":null,"url":null,"abstract":"<div><p>We consider the selection of optimal lead time variability in continuous review inventory models. The variability level is optimized jointly with the lot size and reorder point, where lower variability can be achieved at an extra cost. Low variabilities may correspond to more reliable sources or production processes, and their attainment is one of the implicit goals of JIT logistics. We analyze the resulting tri-variate models, providing sufficient conditions for joint convexity, and hence unique optimum, an algorithm and illustrative examples.</p></div>","PeriodicalId":100476,"journal":{"name":"Engineering Costs and Production Economics","volume":"21 2","pages":"Pages 191-197"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0167-188X(91)90032-W","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Costs and Production Economics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0167188X9190032W","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35
Abstract
We consider the selection of optimal lead time variability in continuous review inventory models. The variability level is optimized jointly with the lot size and reorder point, where lower variability can be achieved at an extra cost. Low variabilities may correspond to more reliable sources or production processes, and their attainment is one of the implicit goals of JIT logistics. We analyze the resulting tri-variate models, providing sufficient conditions for joint convexity, and hence unique optimum, an algorithm and illustrative examples.