4.5 Article

Models for robust tactical planning in multi-stage production systems with uncertain demands

期刊

COMPUTERS & OPERATIONS RESEARCH
卷 37, 期 5, 页码 880-889

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2009.03.012

关键词

Robust tactical planning; Stochastic and robust optimization; Capacity cushion levels

资金

  1. Ecole des Mines de Nantes (EMN), France

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

We consider the problem of designing robust tactical production plans, in a multi-stage production system, when the periodic demands of the finished products are uncertain. First, we discuss the concept of robustness in tactical production planning and how we intend to approach it. We then present and discuss three models to generate robust tactical plans when the finished-product demands are stochastic with known distributions. In particular, we discuss plans produced, respectively, by a two-stage stochastic planning model, by a robust stochastic optimization planning model, and by an equivalent deterministic planning model which integrates the variability of the finished-product demands. The third model uses finished-product average demands as minimal requirements to satisfy, and seeks to offset the effect of demand variability through the use of planned capacity cushion levels at each stage of the production system. An experimental study is carried out to compare the performances of the plans produced by the three models to determine how each one achieves robustness. The main result is that the proposed robust deterministic model produces plans that achieve better trade-offs between minimum average cost and minimum cost variability. Moreover, the required computational time and space are by far less important in the proposed robust deterministic model compared to the two others. (C) 2009 Elsevier Ltd. All rights reserved.

作者

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

评论

主要评分

4.5
评分不足

次要评分

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

推荐

Article Engineering, Industrial

Optimal joint selective imperfect maintenance and multiple repairpersons assignment strategy for complex multicomponent systems

Claver Diallo, Uday Venkatadri, Abdelhakim Khatab, Zhuojun Liu, El-Houssaine Aghezzaf

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)

Article Engineering, Industrial

Benders' decomposition for robust travel time-constrained inventory routing problem

Wouter Lefever, Faycal A. Touzout, Khaled Hadj-Hamou, El-Houssaine Aghezzaf

Summary: This paper discusses the time-constrained inventory routing problem (TCIRP) on a network with uncertain arc travel times, proposing a robust optimization approach with a controlled level of conservatism and developing a Benders' decomposition-based heuristic to cope with the resulting robust counterpart's complexity. The proposed method is compared with two standard approaches and shown to find robust solutions that are not too conservative in reasonable time.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2021)

Article Automation & Control Systems

Base part centered assembly task precedence generation

Joao Costa Mateus, Dieter Claeys, Veronique Limere, Johannes Cottyn, El-Houssaine Aghezzaf

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2020)

Article Engineering, Industrial

A linearisation approach to the stochastic dynamic capacitated lotsizing problem with sequence-dependent changeovers

Niels De Smet, Stefan Minner, El-Houssaine Aghezzaf, Bram Desmet

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2020)

Article Management

Stochastic surgery selection and sequencing under dynamic emergency break-ins

Mathieu Vandenberghe, Stijn De Vuyst, El-Houssaine Aghezzaf, Herwig Bruneel

Summary: Anticipating the impact of urgent emergency arrivals on operating room schedules is challenging. This study introduces a model for surgery scheduling considering stochastic surgery durations and emergency patient arrivals. Detailed analysis of emergency break-ins can lead to lower total cost, and an efficient heuristic is proposed to estimate the solution value with less computational effort.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2021)

Article Engineering, Environmental

Alternative strategies towards a sustainable municipal solid waste management system: A case study in Cairo

Sarah ElSaid, El Houssaine Aghezzaf

WASTE MANAGEMENT & RESEARCH (2020)

Article Engineering, Industrial

A hybrid column-generation and genetic algorithm approach for solving large-scale multimission selective maintenance problems in serial K-out-of-n:G systems

Ryan O'Neil, Claver Diallo, Abdelhakim Khatab, El-Houssain Aghezzaf

Summary: This paper proposes a solution method for the multimission selective maintenance problem by combining column-generation and genetic algorithms. By integrating the genetic algorithm within the classical column-generation framework, high-quality solutions can be quickly obtained. The proposed method performs well in solving large-scale systems.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Automation & Control Systems

Spline-based trajectory generation to estimate execution time in a robotic assembly cell

Muhammad Saeed, Thibaut Demasure, Steven Hoedt, El-Houssaine Aghezzaf, Johannes Cottyn

Summary: An execution time estimation model is proposed to accurately estimate the execution time in a robotic assembly workcell. The model utilizes trajectory generation and task specifications to estimate the task time with reasonable accuracy. Possible directions to further improve the estimation accuracy are discussed.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2022)

Article Engineering, Industrial

A formal skill model to enable reconfigurable assembly systems

Lauren Van De Ginste, Alexander De Cock, Axl Van Alboom, Stijn Huysentruyt, El-Houssaine Aghezzaf, Johannes Cottyn

Summary: This paper presents a multidimensional formal skill model that can be used to describe the needs and capacities in an assembly system, connecting resources with processes and products. It discusses the evaluation of a reconfigurable assembly system and highlights the benefits of a skill-based modeling approach.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Computer Science, Interdisciplinary Applications

State-based verification of industrial control programs with the use of a digital model

Matthias Schamp, El-Houssaine Aghezzaf, Johannes Cottyn

Summary: This paper proposes a workflow that utilizes a 3D digital model to provide additional support to automation engineers, allowing for earlier verification of control logic and reducing real commissioning time. The approach records all occurring states and transitions, visualizes the state graph, and highlights unexpected behavior. Validation on a test case confirms the effectiveness of the proposed approach, with future research aimed at validation on real industrial cases.

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING (2023)

Article Engineering, Industrial

Manual assembly learning, disability, and instructions: an industrial experiment

Jaakko Peltokorpi, Steven Hoedt, Thomas Colman, Kim Rutten, El-Houssaine Aghezzaf, Johannes Cottyn

Summary: Cognitive assistance systems help individuals with learning disabilities to improve their skills and increase their employment opportunities. This study focused on the impact of different forms of instruction and types of disability in a manual assembly task. The results showed that projection instructions enhanced the initial assembly cycle and challenging operators with filtered content improved their independence and task understanding. However, adaptive instructions posed barriers for operators who relied heavily on mentor support. The form of instruction should be carefully considered based on each operator's adaptation and needs. These findings have implications for the human-centric and socially sustainable production agenda of Industry 5.0 and highlight future research priorities.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Engineering, Multidisciplinary

INTEGRATED CONDITION-BASED MAINTENANCE AND MULTI-ITEM LOT-SIZING WITH STOCHASTIC DEMAND

Alp Darendeliler, Dieter Claeys, El-Houssaine Aghezzaf

Summary: This paper tackles the problem of integrated lot-sizing and maintenance decision making in the context of multiple products and stochastic demand. The authors propose a Markov decision process formulation and employ the classic Q-learning algorithm along with a decomposition-based approximate Q-value heuristic to find near-optimal solutions in an efficient manner. To speed up convergence, they introduce a hybrid Q-learning method that initializes Q-values using the output of the approximate Q-value heuristic. The numerical experiments reveal the superiority of the hybrid method and the scalability limitations of tabular methods, leading to the development of three state aggregation schemes that significantly reduce computational time while maintaining good performance.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2023)

Article Engineering, Multidisciplinary

INTEGRATED CONDITION-BASED MAINTENANCE AND MULTI-ITEM LOT-SIZING WITH STOCHASTIC DEMAND

Alp Darendeliler, Dieter Claeys, El-Houssaine Aghezzaf

Summary: This paper investigates the problem of integrated lot-sizing and maintenance decision making with multiple products and stochastic demand. It proposes a combination of Q-learning algorithm and approximate Q-value heuristic to achieve near-optimal solutions. The experiments show that the hybrid Q-learning method outperforms the classic Q-learning algorithm and approximate Q-value heuristic in terms of accuracy and convergence speed. Moreover, to tackle large-scale problems, three state aggregation schemes are developed and applied, with the third scheme achieving similar performance as the hybrid Q-learning method while significantly reducing computational time.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2023)

Proceedings Paper Computer Science, Information Systems

A Formal Skill Model Facilitating the Design and Operation of Flexible Assembly Workstations

Lauren Van De Ginste, Alexander De Cock, Axl Van Alboom, Yogang Singh, El-Houssaine Aghezzaf, Johannes Cottyn

Summary: In the Industry 4.0 era, the demand for highly customized products in small batch sizes has increased, leading to the need for flexible assembly workstations. A skill-centered model is introduced to describe resource activities and flexibility impacts, allowing for versatile formal models to convert flexibility needs into design and operational decisions. This model offers a framework that combines abstract and executable skills, allowing for easy adaptation and application in various settings.

ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: ARTIFICIAL INTELLIGENCE FOR SUSTAINABLE AND RESILIENT PRODUCTION SYSTEMS, PT V (2021)

Proceedings Paper Computer Science, Information Systems

An Integrated Single-Item Lot-Sizing Problem in a Two-Stage Industrial Symbiosis Supply Chain with Stochastic Demands

Cheshmeh Chamani, El-Houssaine Aghezzaf, Abdelhakim Khatab, Birger Raa, Yogang Singh, Johannes Cottyn

Summary: The research considers a two-stage supply chain with two collaborating production plants in industrial symbiosis. Two different formulations are proposed: one using the SAA method to solve the natural model and the other based on a plant location reformulation. Experimental analysis indicates that the plant location reformulation significantly improves optimality gaps and computational times compared to the natural model.

ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: ARTIFICIAL INTELLIGENCE FOR SUSTAINABLE AND RESILIENT PRODUCTION SYSTEMS, APMS 2021, PT II (2021)

Article Computer Science, Interdisciplinary Applications

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa

Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An asynchronous parallel benders decomposition method for stochastic network design problems

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni

Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu

Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie

Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Manipulating hidden-Markov-model inferences by corrupting batch data

William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro

Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images

Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh

Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method

Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao

Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu

Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Review Computer Science, Interdisciplinary Applications

Metaheuristics for bilevel optimization: A comprehensive review

Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas

Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Electric vehicle-based express service network design with recharging management: A branch-and-price approach

Xudong Diao, Meng Qiu, Gangyan Xu

Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

Ramon Piedra-de-la-Cuadra, Francisco A. Ortega

Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Cutting Plane Approaches for the Robust Kidney Exchange Problem

Danny Blom, Christopher Hojny, Bart Smeulders

Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Generating linear programming instances with controllable rank and condition number

Anqi Li, Congying Han, Tiande Guo, Bonan Li

Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.

COMPUTERS & OPERATIONS RESEARCH (2024)