A multi-objective production scheduling case study solved by simulated annealing

Abstract During several decades, research in production scheduling mainly concerns a single criterion to optimize. However, the analysis of the performance of a schedule often involves more than one aspect and therefore requires multi-objective analysis. Such situation appears in the real case study considered here. This paper deals with a production scheduling problem in a flexible (or hybrid) job-shop with particular constraints: batch production; existence of two steps: production of several sub-products followed by the assembly of the final product; possible overlaps for the processing periods of two successive operations of a same job. At the end of the production step, different objectives should be considered simultaneously, among the makespan, the mean completion time, the maximal tardiness, the mean tardiness. The research is based on a real case study, concerning a Tunisian firm. We propose a multi-objective simulated annealing approach to tackle this problem and to propose to the manager an approximation of the set of efficient schedules. Several numerical results are reported.

[1]  Andrzej Jaszkiewicz,et al.  Multiple objective metaheuristic algorithms for combinatorial optimization , 2001 .

[2]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[3]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[4]  J. Teghem,et al.  Solving multi-objective production scheduling problems with Tabu Search , 2000 .

[5]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[6]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[7]  Taïcir Loukil,et al.  Solving multi-objective production scheduling problems using metaheuristics , 2005, Eur. J. Oper. Res..

[8]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[9]  Klaus Jansen,et al.  Approximation algorithms for flexible job shop problems , 2000, Int. J. Found. Comput. Sci..

[10]  Philippe Fortemps,et al.  Performance of the MOSA Method for the Bicriteria Assignment Problem , 2000, J. Heuristics.

[11]  Mohamed Haouari,et al.  Optimal scheduling of the 3-machine assembly-type flow shop , 1999, RAIRO Oper. Res..

[12]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[13]  Xavier Gandibleux,et al.  Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications , 2003 .

[14]  E. L. Ulungu,et al.  MOSA method: a tool for solving multiobjective combinatorial optimization problems , 1999 .

[15]  Jacques Teghem,et al.  An interactive heuristic method for multi-objective combinatorial optimization , 2000, Comput. Oper. Res..

[16]  Ralph E. Steuer Multiple criteria optimization , 1986 .