{"title":"评估为满足动态客户需求而进行稳健容量分配的成本","authors":"B. Scholz-Reiter, Thomas Makuschewitz","doi":"10.1109/ISAM.2011.5942367","DOIUrl":null,"url":null,"abstract":"Long-term production capacity planning has to anticipate future shifts of customer demand. The resulting gap between currently utilized production capacity and available capacity determines the robustness of a production network. In this paper a new approach for assessing the costs of a robust capacity allocation is presented. To this end production networks are modeled by multiclass queueing networks that can be approximated by fluid models. The stability radius reflects the smallest shift of customer demand that destabilizes the network and is used as a measure for robustness. Based on findings for this measure an optimization problem for a cost-oriented capacity allocation is set up.","PeriodicalId":273573,"journal":{"name":"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Assessing the cost of robust capacity allocation for serving dynamic customer demand\",\"authors\":\"B. Scholz-Reiter, Thomas Makuschewitz\",\"doi\":\"10.1109/ISAM.2011.5942367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Long-term production capacity planning has to anticipate future shifts of customer demand. The resulting gap between currently utilized production capacity and available capacity determines the robustness of a production network. In this paper a new approach for assessing the costs of a robust capacity allocation is presented. To this end production networks are modeled by multiclass queueing networks that can be approximated by fluid models. The stability radius reflects the smallest shift of customer demand that destabilizes the network and is used as a measure for robustness. Based on findings for this measure an optimization problem for a cost-oriented capacity allocation is set up.\",\"PeriodicalId\":273573,\"journal\":{\"name\":\"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAM.2011.5942367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAM.2011.5942367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assessing the cost of robust capacity allocation for serving dynamic customer demand
Long-term production capacity planning has to anticipate future shifts of customer demand. The resulting gap between currently utilized production capacity and available capacity determines the robustness of a production network. In this paper a new approach for assessing the costs of a robust capacity allocation is presented. To this end production networks are modeled by multiclass queueing networks that can be approximated by fluid models. The stability radius reflects the smallest shift of customer demand that destabilizes the network and is used as a measure for robustness. Based on findings for this measure an optimization problem for a cost-oriented capacity allocation is set up.