{"title":"A new approach to the dynamic lot size model","authors":"Fuchiao Chyr, Tsong-Ming Lin, Chin-Fu Ho","doi":"10.1016/0167-188X(90)90073-Q","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers a T period planning problem for single stage in which a sequence of known demands D<sub>1</sub>,…, D<sub>T</sub> must be satisfied. An efficient calculation reducing theorem based on cost-path and a new recurrence relation is developed to find optimal policies. Several regeneration points can easily be obtained by comparing setup cost to holding cost. We also prove that the knots of a cost-path satisfy the necessary conditions of the Wagner-Whitin algorithm. The new concept could also be used to eliminate the number of additions in the optimal lot size problem for multi-stage assembly systems.</p></div>","PeriodicalId":100476,"journal":{"name":"Engineering Costs and Production Economics","volume":"20 3","pages":"Pages 255-263"},"PeriodicalIF":0.0000,"publicationDate":"1990-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0167-188X(90)90073-Q","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Costs and Production Economics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0167188X9090073Q","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This paper considers a T period planning problem for single stage in which a sequence of known demands D1,…, DT must be satisfied. An efficient calculation reducing theorem based on cost-path and a new recurrence relation is developed to find optimal policies. Several regeneration points can easily be obtained by comparing setup cost to holding cost. We also prove that the knots of a cost-path satisfy the necessary conditions of the Wagner-Whitin algorithm. The new concept could also be used to eliminate the number of additions in the optimal lot size problem for multi-stage assembly systems.