{"title":"具有有限库存和积压的动态批量模型","authors":"F. Chu, C. Chu","doi":"10.1109/ICSSSM.2005.1499486","DOIUrl":null,"url":null,"abstract":"This paper addresses a real life single item dynamic lot sizing problem arising in a refinery for crude oil procurement. It can be considered as a lot-sizing problem with bounded inventory and backlogging. The production capacity can be considered to be unlimited and the production cost functions are assumed to be linear but time-varying. The results can be easily extended to concave piecewise linear production cost functions. The goal is to minimize the total costs of production, inventory holding and backlogging. We show that the problem can be solved in O(T2) time with general concave inventory holding and backlogging cost functions where T is the number of periods in the planning horizon. We show that the complexity is reduced to O(T) when the inventory holding cost functions are linear and have some required properties.","PeriodicalId":389467,"journal":{"name":"Proceedings of ICSSSM '05. 2005 International Conference on Services Systems and Services Management, 2005.","volume":"153 11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic lot sizing models with bounded inventory and backlogging\",\"authors\":\"F. Chu, C. Chu\",\"doi\":\"10.1109/ICSSSM.2005.1499486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses a real life single item dynamic lot sizing problem arising in a refinery for crude oil procurement. It can be considered as a lot-sizing problem with bounded inventory and backlogging. The production capacity can be considered to be unlimited and the production cost functions are assumed to be linear but time-varying. The results can be easily extended to concave piecewise linear production cost functions. The goal is to minimize the total costs of production, inventory holding and backlogging. We show that the problem can be solved in O(T2) time with general concave inventory holding and backlogging cost functions where T is the number of periods in the planning horizon. We show that the complexity is reduced to O(T) when the inventory holding cost functions are linear and have some required properties.\",\"PeriodicalId\":389467,\"journal\":{\"name\":\"Proceedings of ICSSSM '05. 2005 International Conference on Services Systems and Services Management, 2005.\",\"volume\":\"153 11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICSSSM '05. 2005 International Conference on Services Systems and Services Management, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2005.1499486\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICSSSM '05. 2005 International Conference on Services Systems and Services Management, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2005.1499486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic lot sizing models with bounded inventory and backlogging
This paper addresses a real life single item dynamic lot sizing problem arising in a refinery for crude oil procurement. It can be considered as a lot-sizing problem with bounded inventory and backlogging. The production capacity can be considered to be unlimited and the production cost functions are assumed to be linear but time-varying. The results can be easily extended to concave piecewise linear production cost functions. The goal is to minimize the total costs of production, inventory holding and backlogging. We show that the problem can be solved in O(T2) time with general concave inventory holding and backlogging cost functions where T is the number of periods in the planning horizon. We show that the complexity is reduced to O(T) when the inventory holding cost functions are linear and have some required properties.