4.7 Article

Robust material requirement planning with cumulative demand under uncertainty

期刊

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 55, 期 22, 页码 6824-6845

出版社

TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2017.1353157

关键词

supply chain management; MRP; demand uncertainty; robust optimization; linear programming

资金

  1. Wroclaw University of Science and Technology [0401/0086/16]

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

In this paper, we deal with the problem of tactical capacitated production planning with the demand under uncertainty modelled by closed intervals. We propose a single-item with backordering model under small uncertainty in the cumulative demand for the Master Production Scheduling (MPS) problem with different rules, namely the Lot For Lot rule and the Periodic Order Quantity rule. Then we study a general multilevel, multi-item, multi-resource model with backordering and the external demand on components for the Material Requirement Planning (MRP) problem under uncertainty in the cumulative demand. In order to choose robust production plans for the above problems that hedge against uncertainty, we adopt the well-known minmax criterion. We propose polynomial methods for evaluating the impact of uncertainty on a given production plan in terms of its cost and for computing optimal robust production plans for both problems (MPS/MRP) under the assumed interval uncertainty representation. We show in this way that the robust problems (MPS/MRP) under this uncertainty representation are not much computationally harder than their deterministic counterparts.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

Article Operations Research & Management Science

Combinatorial two-stage minmax regret problems under interval uncertainty

Marc Goerigkl, Adam Kasperski, Pawel Zielinski

Summary: This paper discusses a class of combinatorial optimization problems where a feasible solution can be constructed in two stages, using the minmax regret criterion. The general properties of the problem are established, with specific results shown for the shortest path and selection problems.

ANNALS OF OPERATIONS RESEARCH (2021)

Article Computer Science, Theory & Methods

Soft robust solutions to possibilistic optimization problems

Adam Kasperski, Pawel Zielinski

Summary: This paper discusses a class of uncertain optimization problems, where unknown parameters are modeled by fuzzy intervals. Known concepts of robustness and light robustness for traditional interval uncertainty representation can be generalized to optimize solutions against plausible parameter realizations under this possibilistic setting. Solutions can be efficiently computed for linear programming problems with fuzzy parameters, making them not much computationally harder than their deterministic counterparts.

FUZZY SETS AND SYSTEMS (2021)

Article Computer Science, Interdisciplinary Applications

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty

Marc Goerigk, Adam Kasperski, Pawel Zielinski

Summary: This paper discusses a class of robust two-stage combinatorial optimization problems, showing that the robust two-stage versions of basic network optimization and selection problems are NP-hard even in very restrictive cases. The paper constructs some exact and approximation algorithms for the general problem, as well as polynomial and approximation algorithms for robust two-stage versions of basic problems such as selection and shortest path problems.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Article Engineering, Industrial

Managing disruptions in aircraft assembly lines with staircase criteria

Damien Lovato, Romain Guillaume, Caroline Thierry, Olga Battaia

Summary: In this study, a rescheduling problem in paced aircraft assembly lines was addressed using constraint programming. The newly proposed optimization criteria outperformed classic criteria in terms of solution time and quality, as demonstrated through experiments and managerial insights. This approach provided rapid solutions to managers in efficiently rescheduling tasks with specific constraints.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Computer Science, Artificial Intelligence

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

Adam Kasperski, Pawel Zielinski

Summary: 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.

VIETNAM JOURNAL OF COMPUTER SCIENCE (2022)

Article Computer Science, Theory & Methods

Distributionally robust possibilistic optimization problems

Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper discusses optimization problems with uncertain linear constraints. The constraint coefficients are assumed to be random vectors with partially known probability distributions. Imprecise probabilities are modeled using possibility theory. The distributionally robust approach is used to transform the imprecise constraints into deterministic counterparts, making the resulting problem computationally tractable for a wide class of optimization models, particularly for linear programming.

FUZZY SETS AND SYSTEMS (2023)

Article Operations Research & Management Science

Robust inventory problem with budgeted cumulative demand uncertainty

Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper examines a robust inventory problem with uncertain cumulative demands, where interval-budgeted uncertainty sets are used to model possible demand scenarios. The study demonstrates that for discrete budgeted uncertainty, the robust min-max problem can be solved in polynomial time. Conversely, for continuous budgeted uncertainty, the problem is weakly NP-hard but can still be solved in pseudopolynomial time, particularly for nonoverlapping cumulative demand intervals, using an FPTAS.

OPTIMIZATION LETTERS (2022)

Article Computer Science, Artificial Intelligence

Robust optimization with belief functions

Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper investigates an optimization problem with uncertain objective function coefficients. The uncertainty is described by a discrete scenario set. The concept of belief function is used to define admissible probability distributions over the scenario set. The generalized Hurwicz criterion is applied to compute a solution. The complexity of the problem is explored and exact and approximation methods are proposed.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2023)

Proceedings Paper Automation & Control Systems

Aircraft final assembly line planning with staircase makespan and equity criteria

D. Lovato, R. Guillaume, C. Thierry, O. Battaia

Summary: The importance of ergonomics in assembly lines is increasing, as its study helps improve the working environment and quality of life for operators. Research on ergonomics in aircraft assembly lines has identified tasks that increase the risk of musculoskeletal disorders. To assist industrial managers in reducing these risks, a novel ergonomic index for task scheduling has been developed and tested on real-life instances of aircraft assembly lines.

IFAC PAPERSONLINE (2022)

Proceedings Paper Management

Robust Optimization with Scenarios Using Belief Functions

Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper examines a class of optimization problems with uncertain objective function coefficients, using a scenario set and mass function to specify additional knowledge, and utilizing the generalized Hurwicz criterion to calculate solutions. Various computational properties of the resulting optimization problem are presented.

OPERATIONS RESEARCH PROCEEDINGS 2021 (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Qualitative Bipolar Decision Frameworks Viewed as Pessimistic/Optimistic Utilities

Florence Dupin de Saint-Cyr, Romain Guillaume

Summary: BLF, a bipolar structure, expresses knowledge about decisions through ranked decision principles based on utility of consequences, allowing comparison of decisions under incomplete knowledge. BLF returns a vector of utility/disutility for a decision in terms of achieving positive/negative goals, enabling comparison of decisions. The uncertain knowledge aggregation by BLF is linked to classical aggregation functions used in decision under uncertainty and multi-criteria approaches. The bipolar scale of BLF allows independent handling of positive and negative goals from both optimistic and pessimistic viewpoints.

IEEE CIS INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS 2021 (FUZZ-IEEE) (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Distributionally Robust Optimization in Possibilistic Setting

Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper discusses a class of optimization problems with uncertain constraint coefficients using possibility distributions to encode a family of probability distributions. The distributionally robust approach is applied to transform imprecise constraints into crisp counterparts, with an extension of the model taking into account individual risk aversion of decision makers.

IEEE CIS INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS 2021 (FUZZ-IEEE) (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Robust Possibilistic Optimization with Copula Function

Romain Guillaume, Adam Kasperski, Pawel Zielinski

Summary: This paper discusses a linear optimization problem with uncertain objective function coefficients modeled by possibility distributions and applies a fuzzy robust optimization framework to compute a solution. By considering the dependencies between objective coefficients using a family of copula functions, it is shown that this new approach limits the conservatism of fuzzy robust optimization, evaluates possibility distributions for the objective function values more accurately, and does not increase the complexity of the problem.

IEEE CIS INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS 2021 (FUZZ-IEEE) (2021)

暂无数据