Multi-Objective Optimization in a Job Shop with Energy Costs through Hybrid Evolutionary Techniques

Energy costs are an increasingly important issue in real-world scheduling, for both economic and environmental reasons. This paper deals with a variant of the well-known job shop scheduling problem, where we consider a bi-objective optimization of both the weighted tardiness and the energy costs. To this end, we design a hybrid metaheuristic that combines a genetic algorithm with a novel local search method and a linear programming approach. We also propose an efficient procedure for improving the energy cost of a given schedule. In the experimental study we analyse our proposal and compare it with the state of the art and also with a constraint programming approach, obtaining competitive results.

[1]  Thomas Stützle,et al.  On local optima in multiobjective combinatorial optimization problems , 2007, Ann. Oper. Res..

[2]  Camino R. Vela,et al.  An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization , 2012, Soft Computing.

[3]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[4]  El-Ghazali Talbi,et al.  On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems , 2012, J. Heuristics.

[5]  Christian Bierwirth,et al.  A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective , 2016, Comput. Oper. Res..

[6]  Andrzej Jaszkiewicz,et al.  Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..

[7]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[8]  Barry O'Sullivan,et al.  Analyzing the impact of electricity price forecasting on energy cost-aware scheduling , 2014, Sustain. Comput. Informatics Syst..

[9]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[10]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[11]  Hisao Ishibuchi,et al.  Use of biased neighborhood structures in multiobjective memetic algorithms , 2009, Soft Comput..

[12]  P. Brandimarte,et al.  Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition , 1999 .

[13]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[14]  Janet M. Twomey,et al.  Operational methods for minimization of energy consumption of manufacturing equipment , 2007 .

[15]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[16]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[17]  Sanja Petrovic,et al.  An investigation into minimising total energy consumption and total weighted tardiness in job shops , 2014 .

[18]  Tom Van Woensel,et al.  Approximating multi-objective scheduling problems , 2013, Comput. Oper. Res..

[19]  Raymond Chiong,et al.  Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption , 2016 .

[20]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[21]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[22]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

[23]  Carlos A. Coello Coello,et al.  HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

[24]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[25]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[26]  Roman Barták,et al.  Unary Resource Constraint with Optional Activities , 2004, CP.

[27]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[28]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..