Adjunct Professor - Department of Accounting, Auditing and Business Analytics
Christ, Quentin; Dauzère-Pérès, Stéphane & Lepelletier, Guillaume (2019)
An Iterated Min-Max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
European Journal of Operational Research, 279(2), s. 419- 428. Doi: 10.1016/j.ejor.2019.06.007
This paper presents an original approach for a practical workload balancing problem on non-identical parallel machines in manufacturing systems. After showing the limitations of an initial model, in partic- ular to support relevant decisions, the min–max fairness workload balancing problem is motivated and positioned in the literature. The Iterated Min–Max (IMM) procedure is then presented, with its properties, and illustrated. The IMM consists in solving a succession of linear programs using information from dual variables obtained at each iteration. Computational results on industrial instances show the relevance of the approach when compared to the initial model. The current use of the IMM procedure in an industrial tool is discussed.
Lima, Alexandre; Borodin, Valeria, Dauzère-Pérès, Stéphane & Vialletelle, Philippe (2019)
Sampling-based release control of multiple lots in time constraint tunnels
Computers in industry (Print), 110, s. 3- 11. Doi: 10.1016/j.compind.2019.04.014
Dauzère-Pérès, Stéphane; Hassoun, Michael & Sendon, Alejandro (2019)
A Lagrangian heuristic for minimising risk using multiple heterogeneous metrology tools
International Journal of Production Research Doi: 10.1080/00207543.2019.1614693
García-León, Andrés Alberto; Dauzère-Pérès, Stéphane & Mati, Yazid (2019)
An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
In this paper, a general local search approach for the Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP) is proposed to determine a Pareto front for any combination of regular criteria. The approach is based on a disjunctive graph, a fast estimation function to evaluate moves and a hierarchical test to efficiently control the set of non-dominated solutions. Four search strategies using two neighborhood structures are developed. Numerical experiments are conducted on test instances of the literature with three sets of criteria to minimize and using metrics to evaluate and compare Pareto fronts. The results show that our approach provides sets of non-dominated solutions of good quality.
Nattaf, Margaux; Dauzère-Pérès, Stéphane, Yugma, Claude & Wu, Cheng-Hung (2019)
Parallel Machine Scheduling with Time Constraints on Machine Qualifications
Computers & Operations Research, 107, s. 61- 76. Doi: 10.1016/j.cor.2019.03.004
This paper studies the scheduling of jobs of different families on parallel machines, where not all machines are qualified (eligible) to process all job families. Originating from semiconductor manufacturing, an important constraint imposes that the time between the processing of two consecutive jobs of the same family on a machine does not exceed a given time limit. Otherwise, the machine becomes disqualified for this family. The goal is to minimize both the flow time and the number of disqualifications of job families on machines. To solve this problem, an integer linear programming model and a constraint programming model are proposed, as well as two improvement procedures of existing heuristics: A Recursive Heuristic and a Simulated Annealing algorithm. Numerical experiments on randomly generated instances compare the performances of each method.
Mohammadi, Mehrdad; Dauzère-Pérès, Stéphane & Yugma, Claude (2019)
Performance evaluation of single and multi-class production systems using an approximating queuing network
Performance evaluation, and in particular cycle time estimation, is critical to optimise production plans in high-tech manufacturing industries. This paper develops a new aggregation model based on queuing network, so-called queue-based aggregation (QAG) model, to estimate the cycle time in a production system. Multiple workstations in serial and job-shop configurations are aggregated into a single-step workstation. The parameters of the aggregated workstation are approximated based on the parameters of the original workstations. Numerical experiments indicate that the proposed QAG model is computationally efficient and yields fairly accurate results when compared to other aggregation approaches in the literature.
Engebrethsen, Erna S. & Dauzère-Pérès, Stéphane (2019)
Transportation mode selection in inventory models: A literature review
European Journal of Operational Research, 279, s. 1- 25. Doi: 10.1016/j.ejor.2018.11.067
Despite the significant share of transportation costs in logistics costs and the importance of considering transportation in inventory models, the majority of the existing models either neglect or simplify transportation costs and capacities, often assuming that only one transportation option is available. The complexity of modeling and choosing the optimal transportation mode or combination of modes has increased due to the increased variety of transportation options and pricing schedules after deregulation. In this paper, we review and classify inventory models with multiple transportation modes focusing on the freight cost functions, mode characteristics and the methods for modeling multiple modes. To our knowledge, no such review has previously been published. We discuss the benefits and weaknesses of each modeling method and, based on industrial practices, identify new areas for research.
Tamssaouet, Karim; Dauzère-Pérès, Stéphane & Yugma, Claude (2018)
Metaheuristics for the job-shop scheduling problem with machine availability constraints
Computers & industrial engineering, 125, s. 1- 8. Doi: 10.1016/j.cie.2018.08.008
This paper addresses the job-shop scheduling problem in which the machines are not available during the whole planning horizon and with the objective of minimizing the makespan. The disjunctive graph model is used to represent job sequences and to adapt and extend known structural properties of the classical job-shop scheduling problem to the problem at hand. These results have been included in two metaheuristics (Simulated Annealing and Tabu Search) with specific neighborhood functions and diversification structures. Computational experiments on problem instances of the literature show that our Tabu Search approach outperforms Simulated Annealing and existing approaches.
Senoussi, Ahmed; Dauzère-Pérès, Stéphane, Brahimi, Nadjib, Penz, Bernard & Mouss, Nadia Kinza (2018)
Heuristics Based on Genetic Algorithms for the Capacitated Multi Vehicle Production Distribution Problem
Computers & Operations Research, 96(August), s. 108- 119. Doi: 10.1016/j.cor.2018.04.010
In this paper, we consider the integration of production, inventory and distribution decisions in a sup- ply chain composed of one production facility supplying several retailers located in the same region. The supplier is far from the retailers compared to the distance between retailers. Thus, the traveling cost of each vehicle from the supplier to the region is assumed to be fixed and there is a fixed delivery (service) cost for each visited retailer. The objective is to minimize the sum of the costs at the production facility and at the retailers. The problem is more general than the One-Warehouse Multi-Retailer problem and is a special case of the Production Routing Problem. Five heuristics based on a Genetic Algorithm are proposed to solve the problem. In particular, three of them include the resolution of a Mixed Integer Pro- gram as subproblem to generate new individuals in the population. The results show that the heuristics can find optimal solutions for small and medium size instances. On large instances, the gaps obtained by the heuristics in less than 300 s are better than the ones obtained by a standard solver in two hours.
Kao, Yu-Ting; Dauzère-Pérès, Stéphane, Blue, Jakey & Chang, Shi-Chung (2018)
Impact of integrating equipment health in production scheduling for semiconductor fabrication
Computers & industrial engineering, 120(June), s. 450- 459. Doi: 10.1016/j.cie.2018.04.053
Monitoring the Equipment Health Indicator (EHI) of critical machines helps effectively to maintain process quality and reduce wafer scrap, rework, and machine breakdowns. To model and illustrate the integration of EHI in scheduling decisions to balance between productivity and quality risk, this paper presents two mixed integer linear programs to schedule jobs on heterogeneous parallel batching machines. The capability of a machine to process a job is categorized as preferred, acceptable, and unfavorable based on the job requirements. The quality risk of processing a job by a machine is a function of its EHI and the capability level of the machine for the job, which is modeled as a penalty in the objective function of trading-off between productivity and quality risk. The first model is static and assumes constant EHI of machines on the scheduling horizon, whereas the second model considers the EHI dynamics, i.e., the machine condition deteriorates over time based on the scheduled jobs. Numerical experiments indicate the potential applications of using EHI-integrated scheduling approaches to analyze and optimize the trade-off between productivity and quality risk.
Absi, Nabil; Archetti, Claudia, Dauzère-Pérès, Stéphane, Feillet, Dominique & Speranza, M. Grazia (2018)
Comparing sequential and integrated approaches for the production routing problem
European Journal of Operational Research, 269(2), s. 633- 646. Doi: 10.1016/j.ejor.2018.01.052
We consider the Production Routing Problem where production planning, inventory management and distribution planning decisions must be taken. We compare two sequential approaches, one in which production decisions are optimized first and one in which distribution decisions are optimized first, with an integrated approach where all decisions are simultaneously optimized. Some properties of the solutions obtained with the different approaches are shown. Computational experiments are performed on instances of different size which are generated using two critical parameters. The numerical results illustrate the properties and show that the benefits of the integrated approach over the two sequential ones depend on the trade-off between production and distribution costs and on the trade-off between setup and inventory costs in production.
Rowshannahad, Mehdi; Absi, Nabil, Dauzère-Pérès, Stéphane & Cassini, Bernard (2018)
Multi-item bi-level supply chain planning with multiple remanufacturing of reusable by-products
JOURNAL OF PRODUCTION ECONOMICS, 198, s. 25- 37. Doi: 10.1016/j.ijpe.2018.01.014
In this paper, we investigate a multi-item production planning problem in which remanufacturable raw materials are used for manufacturing the final products. The used raw material (considered as a kind of by-product) needs to be remanufactured before being suitable to be used again to manufacture other final products. However, byproducts can be remanufactured only a given number of times. The manufacturing and remanufacturing processes are performed in separated production processes with limited capacity. Each product may be produced using specific raw material references (newly purchased and/or remanufactured). The original industrial case study is based on the supply chain of Silicon-On-Insulator fabrication units. The problem is modeled as a mixed integer linear mathematical program. Using numerical examples based on industrial data, the model is validated and its behavior is analyzed. Finally, some industrial and academic perspectives to this study are proposed.
Shen, Liji; Dauzère-Pérès, Stéphane & Neufeld, Janis S. (2017)
Solving the flexible job shop scheduling problem with sequence-dependent setup times
European Journal of Operational Research, 265(2), s. 503- 516. Doi: 10.1016/j.ejor.2017.08.021
This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times and where the objective is to minimize the makespan. We first present a mathematical model which can solve small instances to optimality, and also serves as a problem representation. After studying structural properties of the problem using a disjunctive graph model, we develop a tabu search algorithm with specific neighborhood functions and a diversification structure. Extensive experiments are conducted on benchmark instances. Test results first show that our algorithm outperforms most existing approaches for the classical flexible job shop scheduling problem. Additional experiments also confirm the significant improvement achieved by integrating the propositions introduced in this study.
Brahimi, Nadjib; Absi, Nabil, Dauzère-Pérès, Stéphane & Nordli, Atle (2017)
Single-item dynamic lot-sizing problems: An updated survey
European Journal of Operational Research, 263(3), s. 838- 863. Doi: 10.1016/j.ejor.2017.05.008
Knopp, Sebastian; Dauzère-Pérès, Stéphane & Yugma, Claude (2017)
A batch-oblivious approach for Complex Job-Shop scheduling problems
European Journal of Operational Research, 263(1), s. 50- 61. Doi: 10.1016/j.ejor.2017.04.050
Altazin, Estelle; Dauzère-Pérès, Stéphane, Ramond, François & Trefond, Sabine (2017)
Rescheduling through stop-skipping in dense railway systems
Transportation Research Part C: Emerging Technologies, 79, s. 73- 84. Doi: 10.1016/j.trc.2017.03.012
Dauzère-Pérès, Stéphane; Hassoun, Michael & Sendon, Alejandro (2016)
Allocating metrology capacity to multiple heterogeneous machines
International Journal of Production Research, 54(20), s. 6082- 6091. Doi: 10.1080/00207543.2016.1187775
Mönch, Lars; Chien, Chen-Fu, Dauzère-Pérès, Stéphane, Ehm, Hans & Fowler, John (1)
Modelling and analysis of semiconductor supply chains
International Journal of Production Research [Kronikk]
Tamssaouet, Karim; Dauzère-Pérès, Stéphane, Yugma, Claude, Knopp, Sebastian & Pinaton, Jacques (2018)
A Study on the Integration of Complex Machines in Complex Job Shop Scheduling
[Academic lecture]. 2018 Winter Simulation Conference.
In this paper, we study the problem of considering the internal behavior of complex machines when solving complex job-shop scheduling problems encountered in semiconductor manufacturing. The scheduling problem in the diffusion area is presented, and the complex structures and behaviors of the different machine types in this area are described. Previous related research is reviewed, and our approach to consider the complexity of these machines with batching constraints when scheduling the diffusion area is described. The main part of the paper presents and discusses numerical experiments on industrial instances to show the benefit of choosing a suitable modeling for complex machines.
Beraudy, Sébastien; Absi, Nabil & Dauzère-Pérès, Stéphane (2018)
Production Planning Models with Productivity and Financial Objective Functions in Semiconductor Manufacturing
[Academic lecture]. 2018 Winter Simulation Conference.
In the semiconductor manufacturing literature, production planning models mainly aim at minimizing total production, inventory and backlog costs. Solving these models may lead to a poor utilization of the production capacity when there are not enough demands. In this paper, after presenting a first generic linear programming model with fixed lead times when total costs are minimized, a model where productivity is maximized is introduced. Then, a model is proposed that includes the maximization of profit and considers the net present value of the financial objective function. These models are then compared using a data set from the literature. The numerical results show that, although the model with productivity maximization is performing as expected, the model with profit maximization is more relevant since it also helps to increase productivity. The impact of the actualization rate is analyzed, and also the limitations of the production of some products.
Dauzère-Pérès, Stéphane (2017)
Achievements and Lessons Learned from a Long-Term Academic-Industrial Collaboration
[Academic lecture]. 2017 Winter Simulation Conference.
I had the opportunity to work for about 14 years on many different projects with two manufacturing sites of the French-Italian semiconductor company STMicroelectronics. Supported by European, national and industrial projects, this still active long-term academic-industrial collaboration led to many scientific and industrial achievements, spreading to other companies. Through regular exchanges, engineers, researchers, PhD and Master students were able to present their problems, their advances and generate new research projects. After some history of the collaboration, the presentation will survey some of the main research and industrial results in qualification and flexibility management, production and capacity planning, scheduling, automated transportation, dynamic sampling and time constraint management. Challenges faced and lessons learned when applying Operations Research and Industrial Engineering in practice, and in particular in semiconductor manufacturing, will be discussed. Benefits for both practitioners and researchers will be emphasized, such as the opportunity to propose and study new relevant problems and develop and apply novel approaches using actual industrial data.
|1992||Paul Sabatier University (Toulouse III), France.||PhD|
|2016 - Present||BI Norwegian Business School||Adjunct Professor, Department of Accounting, Auditing and Business Analytics|
|2004 - Present||Ecole des Mines de Saint-Etienne||Professor, Center of Microelectronics in Provence, Georges Charpak Campus|
|2013 - 2014||Ecole des Mines de Saint-Etienne||Director of the Center of Microelectronics in Provence|
|2004 - 2013||Ecole des Mines de Saint-Etienne||Head of the Department of Manufacturing Sciences and Logistics|
|2003 - 2009||Molde University College||Invited Professor|
|2000 - 2004||Ecole des Mines de Nantes||Professor, Department of Automatic Control and Industrial Engineering|