Article
Management
Daryna Dziuba, Christian Almeder
Summary: This paper proposes a general two-step construction heuristic (2-SCH) to solve the classical single-level multi-item capacitated lot-sizing problem (CLSP) in production planning. By sorting customer orders and iteratively adding them to a preliminary production plan, different problem variations can be easily solved. Computational experiments show that the 2-SCH outperforms other construction heuristics in CLSP without setup times and performs better than a genetic programming approach and a construction heuristic in CLSP with setup times.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Matthieu Gruson, Jean-Francois Cordeau, Raf Jans
Summary: This article addresses a three-level lot sizing and replenishment problem and introduces the concept of demand splitting. The authors develop two heuristics and compare them to a branch-and-cut algorithm. Experimental results show that the top-down approach performs better in terms of cost, and splitting possibilities lead to large gains.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Engineering, Industrial
Fayez F. Boctor
Summary: This paper deals with a more realistic version of the lot sizing and scheduling problem, where a single machine processes different products. The objective is to minimize the sum of setup costs and inventory holding costs. The paper presents a mathematical formulation of the problem and two specially designed solution heuristics.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Livia Maria Pierini, Kelly Cristina Poldi
Summary: Many industrial processes involve costs such as setup, production, waste, inventory, and transport, which can vary depending on the location of the plants. The integration of lot sizing, cutting stock, and transport planning can lead to cost reduction. This paper presents an integer linear programming formulation and a solution methodology for the integrated lot sizing and cutting stock problem with multiple plants. The tests showed that the proposed approach has lower total costs and the solution methodology has satisfactory performance.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Management
Jesus O. Cunha, Rafael A. Melo
Summary: This study examines the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure, proposing new valid inequalities and optimization methods, and conducting computational experiments. The results show that these methods can significantly improve the solving capability of mixed integer programming solvers.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Engineering, Industrial
Pedro Pineyro, Omar Viera
Summary: This study addresses an extension of the economic lot-sizing problem with remanufacturing, considering returns of heterogeneous quality. Various solutions are provided for general cost functions, stationary costs, and different set-up schemes. Extensive numerical experimentation leads to managerial insights, showing profitable strategies for remanufacturing returns of the same quality in certain periods.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Engineering, Multidisciplinary
Hyoung-Ho Doh, Dong-Ho Lee
Summary: This study addresses the problem of dynamic lot-sizing for remanufacturing systems, proposing a solution and analyzing the computational results. The results show that the cluster-move based approach, which explicitly considers components commonality, outperforms the individual-move based one in terms of effectiveness and solution speed.
APPLIED MATHEMATICAL MODELLING
(2024)
Article
Operations Research & Management Science
Nata Goulart, Thiago F. Noronha, Martin G. Ravetti, Mauricio C. de Souza
Summary: In the integrated uncapacitated lot sizing and bin packing problem, decisions regarding replenishment from suppliers and delivery of client orders need to be coupled to minimize total costs. Proposed methods including mixed integer linear programming formulations and heuristics efficiently achieve small optimality gaps in reduced computational times.
RAIRO-OPERATIONS RESEARCH
(2021)
Article
Engineering, Multidisciplinary
Hyoung-Ho Doh, Dong-Ho Lee
Summary: This study addresses a dynamic lot-sizing problem for remanufacturing systems, proposes an integer programming model to minimize the total cost, and introduces two-stage heuristics to solve the problem, showing that these methods can effectively solve small-sized instances.
ENGINEERING OPTIMIZATION
(2022)
Article
Computer Science, Interdisciplinary Applications
Elodie Suzanne, Nabil Absi, Valeria Borodin, Wilco van den Heuvel
Summary: This paper introduces a new production planning problem in industrial symbiosis and proposes a heuristic based on Lagrangian decomposition to efficiently solve it. Extensive numerical experiments validate the effectiveness of the proposed solution method, and a comparative analysis of different collaboration policies sheds light on the managerial implications of industrial symbiosis.
COMPUTERS & INDUSTRIAL ENGINEERING
(2021)
Article
Engineering, Industrial
Ramez Kian, Emre Berk, Ulku Gurler, Hassan Rezazadeh, Baback Yazdani
Summary: This article examines the production planning problem in the presence of (dis)economies-of-scale in production costs with a fixed forecast horizon and on a rolling horizon basis. Variants of three commonly used heuristics are proposed for this specific setting. The extensive numerical study demonstrates that longer forecast horizons are less effective in obtaining cost-effective production plans when the production cost function is convex and fixed setup costs are lower, indicating a lack of economies-of-scale.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2021)
Article
Management
Willy A. O. Soler, Maristela O. Santos, Kerem Akartunali
Summary: This paper addresses a lot sizing and scheduling problem in the food industry, proposing a mixed integer programming model and a branching rule, as well as an efficient relax-and-fix procedure. Computational experiments show that the proposed approaches outperform a commercial solver and an established relax-and-fix heuristic in the literature.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
(2021)
Article
Engineering, Industrial
Meisam Pour-Massahian-Tafti, Matthieu Godichaud, Lionel Amodeo
Summary: This paper addresses the problem of disassembly lot-sizing for the single-product type, proposing three new MIP formulations and investigating two efficient heuristics for real-case applications. The research highlights the relevance of disposal decisions in disassembly lot-sizing models for saving inventory costs.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2021)
Article
Engineering, Industrial
Caio Paziani Tomazella, Maristela Oliveira Santos, Douglas Alem, Raf Jans
Summary: This paper presents novel models that address the Integrated Procurement and Lot-Sizing Problem with multiple customers and backlogging. It proposes optimizing service-levels with minimal costs using a budget constraint, considering specific demands from various customers. The models improve service compared to traditional cost models and enforce service equity among different customers, although at the expense of a deterioration in the global fill-rate.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Management
Desiree M. Carvalho, Maria C. Nascimento
Summary: This paper addresses the integrated lot sizing and scheduling problem on parallel machines, proposing efficient methods that significantly outperform the CPLEX solver in most tested instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Engineering, Industrial
Felicien Barhebwa-Mushamuka, Stephane Dauzere-Peres, Claude Yugma
Summary: This paper proposes a novel global scheduling approach for controlling cycle time in large complex manufacturing systems. The approach takes into account the interaction between workcentres and utilizes global information to optimize production targets.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Operations Research & Management Science
Stephane Dauzere-Peres, Sigrid Lise Nonas
Summary: This paper presents a mathematical model for solving a scheduling problem in a company's production process for custom propellers. The model proposed by Nonas and Olsen in 2005 aimed to minimize total tardiness, but its solution time was too long for realistic problem instances. In this paper, a new time indexed formulation is proposed, which can solve most industrial problem instances in less than 10 minutes. Additionally, the paper considers limited storage capacity and proposes different methods to balance between total tardiness and maximum tardiness. The authors also discuss the extension of the model to include unexpected events.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
(2023)
Article
Engineering, Industrial
Quentin Christ, Stephane Dauzere-Peres, Guillaume Lepelletier
Summary: This paper addresses a practical operational production planning problem in complex manufacturing systems and introduces a three-step approach to solve the problem. The approach is further optimized by introducing new smoothing rules and their performance is studied. The paper also presents how the decision support tool is embedded in the production planning process to bridge the gap between the upper and lower planning levels.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Transportation Science & Technology
Waleed Najy, Claudia Archetti, Ali Diabat
Summary: With the retail market being highly competitive, it is crucial for businesses to conduct cost-efficient operations. Therefore, the logistics industry has started incorporating drones into the delivery cycle to reduce transportation costs. The concept of collaborative truck-and-drone operation has been proposed as a way to combine the advantages of both modes of delivery while minimizing their downsides.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
Article
Engineering, Industrial
Erna Engebrethsen, Stephane Dauzere-Peres
Summary: The complexity of decision-making in purchasing transportation services has increased due to the availability of more options and pricing schedules. This study focuses on a real-world decision problem faced by a Scandinavian company and proposes a novel multi-mode lot-sizing model to illustrate the cost impact of accurately modeling transportation costs and allowing flexible usage of transportation modes. The study concludes that increasing the flexibility of mode selection in transportation strategies can significantly reduce costs.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Louise Penz, Stephane Dauzere-Peres, Margaux Nattaf
Summary: This paper discusses the integration of production and maintenance decisions in the context of Industry 4.0. It proposes two cases of scheduling jobs on a single machine to minimize completion times, taking into account the machine's health index. Two Mixed Integer Linear Programming models are presented, and the second model outperforms the first in terms of efficiency. Computational experiments also consider the impact of valid inequalities.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Engineering, Industrial
Melek Rodoplu, Stephane Dauzere-Peres, Philippe Vialletelle
Summary: Motivated by a practical problem, this paper investigates the integrated planning of maintenance operations and workload allocation on a set of machines in a workshop. The main goal is to find a feasible plan that satisfies the machine capacity by allocating the production quantities to machines and assigning maintenance operations as late as possible in their time windows. Various original mathematical models are presented, including models that allow maintenance operations and some production quantities to overlap two consecutive periods. Computational experiments show significant reduction in the earliness of maintenance operations by allowing this overlapping.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Engineering, Manufacturing
Gregory A. Kasapidis, Stephane Dauzere-Peres, Dimitris C. Paraskevopoulos, Panagiotis P. Repoussis, Christos D. Tarantilis
Summary: This paper aims to connect the work presented in Dauzere-Peres et al. (1998) and more recently in Kasapidis et al. (2021) on the multiresource flexible job-shop scheduling problem with nonlinear routes or equivalently with arbitrary precedence graphs. The authors propose a mixed integer linear programming (MIP) model and a constraint programming (CP) model to formulate the problem. They compare the theorems introduced in Dauzere-Peres et al. (1998) and Kasapidis et al. (2021) and propose a new theorem extension. Computational experiments were conducted to assess the efficiency and effectiveness of all propositions. Lastly, the proposed MIP and CP models are tested on benchmark problems of the literature and comparisons are made with state-of-the-art algorithms.
PRODUCTION AND OPERATIONS MANAGEMENT
(2023)
Article
Economics
Diego Delle Donne, Laurent Alfandari, Claudia Archetti, Ivana Ljubic
Summary: In this study, we propose a delivery strategy called Freight-On-Transit (FOT) that combines freight transportation with mass mobility systems in urban areas to minimize negative externalities caused by transportation. The system utilizes the residual capacity on public transport means to transport parcels from distribution centers to stop locations on public vehicle itineraries, and then they are delivered to the final destination using green vehicles. We focus on the strategic decisions related to defining the public transportation network and propose different formulations for the problem and effective heuristic solution approaches based on column generation.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2023)
Article
Computer Science, Interdisciplinary Applications
Mario Flores-Gomez, Valeria Borodin, Stephane Dauzere-Peres
Summary: This paper addresses the flexible job-shop scheduling problem with stochastic processing times. It considers the use of probabilistic information to find a sequence that is insensitive to shop floor disturbances. A tabu search and Monte Carlo sampling-based approximation method is proposed for solving this problem. Extensive computational experiments are conducted to evaluate the relevance of the makespan service level and the performance of the proposed solution method. The drawbacks of various reference scenarios and the accuracy of the proposed solutions are also analyzed.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Lu Chen, Wenhui Yang, Kejun Qiu, Stephane Dauzere-Peres
Summary: This paper focuses on a parallel-machine scheduling problem in wafer fabrication, specifically in the photolithography process. A lexicographic optimization approach is proposed to minimize total quality loss and tardiness. The study also considers an optional maintenance activity to restore machine condition. Based on optimality properties, an exact scheduling algorithm is developed. Experimental analyses using real data confirm the effectiveness of the algorithm and provide managerial insights.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Management
Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubi
Summary: This study introduces a solution for finding the k-core and Collapsed k-Core Problem using mathematical programming for the first time, providing two bilevel programs and comparing their performance with existing solvers.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Liji Shen, Stephane Dauzere-Peres, Sohnke Maecker
Summary: This paper addresses the issue of energy efficient scheduling in a flexible job shop. It aims to minimize total energy cost under a time-of-use pricing scheme, while ensuring that the schedule does not exceed a maximum makespan. The problem is initially formulated as a mixed integer program and then extensively studied for the simpler case of a fixed sequence of operations. The derived properties of this specific problem are utilized to propose heuristic approaches and an iterative tabu search algorithm for the general problem. Computational experiments are conducted to evaluate the solution methods and potential energy cost savings based on flexibility of the makespan and time-of-use structures.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Andrea Di Placido, Claudia Archetti, Carmine Cerrone, Bruce Golden
Summary: This paper studies the generalized close enough traveling salesman problem (GCETSP), which involves associating each customer with a set of disks of different radii. The goal is to determine the route that maximizes the difference between the total collected prize and the route length. The proposed genetic algorithm (GA) shows promising results in finding high-quality solutions with a short computing time.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Engineering, Industrial
Karim Tamssaouet, Erna Engebrethsen, Stephane Dauzere-Peres
Summary: This paper addresses the tactical joint inventory and transportation planning problem for multiple items with deterministic and time-varying demand, considering different transportation modes and item fragmentation. The proposed problem tackles the conflict between potentially reducing the number of containers used and negatively impacting handling and shipping operations. Several Mixed Integer Linear Programming models are suggested and a relax-and-fix heuristic is proposed for solving the problem. Realistic instances are used for computational experiments to identify the most efficient model, study the impact of key parameters, and analyze the efficiency of the heuristic. Managerial insights are derived to identify contexts requiring joint optimization and the impact of item fragmentation constraints, and future research directions are proposed.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
(2023)
