3.8 Article

Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands

期刊

VIETNAM JOURNAL OF COMPUTER SCIENCE
卷 9, 期 3, 页码 285-296

出版社

WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S2196888822500166

关键词

Production planning; demand uncertainty; interval budgeted uncertainty; robust optimization

向作者/读者索取更多资源

This paper discusses a production planning problem with inventory and backordering levels. It models the uncertainty in cumulative demands using an interval uncertainty representation with continuous budget and applies the robust minmax criterion to compute an optimal production plan. A row and column generation algorithm is constructed to solve the problem. Computational tests demonstrate the efficiency of the algorithm for instances with up to 100 periods and its ability to generate solutions that are robust against demand uncertainty.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据