外包规划模型与算法

IEEE International Conference on e-Business Engineering (ICEBE'05) Pub Date : 2005-10-12 DOI:10.1109/ICEBE.2005.9

Xiao Liu, Chengen Wang, Xiaochuan Luo, Dingwei Wang

{"title":"外包规划模型与算法","authors":"Xiao Liu, Chengen Wang, Xiaochuan Luo, Dingwei Wang","doi":"10.1109/ICEBE.2005.9","DOIUrl":null,"url":null,"abstract":"This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A model and algorithm for out-sourcing planning\",\"authors\":\"Xiao Liu, Chengen Wang, Xiaochuan Luo, Dingwei Wang\",\"doi\":\"10.1109/ICEBE.2005.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time\",\"PeriodicalId\":118472,\"journal\":{\"name\":\"IEEE International Conference on e-Business Engineering (ICEBE'05)\",\"volume\":\"118 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on e-Business Engineering (ICEBE'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEBE.2005.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Business Engineering (ICEBE'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2005.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文研究了一个包含外包的动态批量模型。未满足的需求全部外包，不积压，库存能力有限，禁止短缺。成本是凹形且随时间变化的。得到了最优解的一些新的性质，并提出了在强多项式时间内求解该问题的动态规划算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A model and algorithm for out-sourcing planning

This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE International Conference on e-Business Engineering (ICEBE'05)

自引率

0.00%

发文量