{"title":"考虑累积需求区间预算不确定性的鲁棒生产计划问题求解","authors":"A. Kasperski, P. Zieliński","doi":"10.1142/s2196888822500166","DOIUrl":null,"url":null,"abstract":"In this paper, a production planning problem with inventory and backordering levels is discussed. It is assumed that cumulative demands in periods are uncertain and an interval uncertainty representation with continuous budget is used to model this uncertainty. The robust minmax criterion is applied to compute an optimal production plan. A row and column generation algorithm is constructed for solving the problem. Results of some computational tests are shown which demonstrate that the algorithm is efficient for the instances with up to 100 periods and returns solutions that are robust against the uncertainty in demands.","PeriodicalId":256649,"journal":{"name":"Vietnam. J. Comput. Sci.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands\",\"authors\":\"A. Kasperski, P. Zieliński\",\"doi\":\"10.1142/s2196888822500166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a production planning problem with inventory and backordering levels is discussed. It is assumed that cumulative demands in periods are uncertain and an interval uncertainty representation with continuous budget is used to model this uncertainty. The robust minmax criterion is applied to compute an optimal production plan. A row and column generation algorithm is constructed for solving the problem. Results of some computational tests are shown which demonstrate that the algorithm is efficient for the instances with up to 100 periods and returns solutions that are robust against the uncertainty in demands.\",\"PeriodicalId\":256649,\"journal\":{\"name\":\"Vietnam. J. Comput. Sci.\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vietnam. J. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s2196888822500166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vietnam. J. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s2196888822500166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands
In this paper, a production planning problem with inventory and backordering levels is discussed. It is assumed that cumulative demands in periods are uncertain and an interval uncertainty representation with continuous budget is used to model this uncertainty. The robust minmax criterion is applied to compute an optimal production plan. A row and column generation algorithm is constructed for solving the problem. Results of some computational tests are shown which demonstrate that the algorithm is efficient for the instances with up to 100 periods and returns solutions that are robust against the uncertainty in demands.