A genetic algorithm for energy-efficiency in job-shop scheduling

Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost, and quality as optimization objectives. Currently, energy-efficiency is also taken into consideration in these problems. However, this problem is NP-hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to solve an extended version of the Job-shop Scheduling Problem in which machines can consume different amounts of energy to process tasks at different rates (speed scaling). This problem represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different speeds. The evaluation section shows that a powerful commercial tool for solving scheduling problems was not able to solve large instances in a reasonable time, meanwhile our genetic algorithm was able to solve all instances with a good solution quality.

[1]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[2]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[3]  Massimo Paolucci,et al.  Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops , 2012 .

[4]  Philippe Laborie,et al.  IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems , 2009, CPAIOR.

[5]  Wai Keung Wong,et al.  Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry , 2006, Comput. Ind. Eng..

[6]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[7]  Lin Li,et al.  Multi-objective optimization of milling parameters – the trade-offs between energy, production rate and cutting quality , 2013 .

[8]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[9]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.

[10]  Shaya Sheikh,et al.  Multi-objective energy aware multiprocessor scheduling using bat intelligence , 2013, J. Intell. Manuf..

[11]  Alessandro Agnetis,et al.  A job-shop problem with one additional resource type , 2011, J. Sched..

[12]  Mauricio G. C. Resende,et al.  A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..

[13]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[15]  Colin R. Reeves,et al.  A review of scheduling problems in radiotherapy , 2006 .

[16]  Reimund Neugebauer,et al.  Structure principles of energy efficient machine tools , 2011 .

[17]  Lin Li,et al.  Energy requirements evaluation of milling machines based on thermal equilibrium and empirical modelling , 2013 .

[18]  Sumiani Binti Yusoff,et al.  Renewable energy from palm oil - innovation on effective utilization of waste. , 2006 .

[19]  K. Aunan,et al.  CLEANER PRODUCTION AS CLIMATE INVESTMENT—INTEGRATED ASSESSMENT IN TAIYUAN CITY , 2005 .

[20]  Ricardo Pérez-Rodríguez,et al.  Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm , 2014 .

[21]  A. S. Jain,et al.  Job-shop scheduling using neural networks , 1998 .

[22]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[23]  Marco Taisch,et al.  Multi-objective genetic algorithm for energy-efficient job shop scheduling , 2015 .

[24]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2006, SPAA '06.

[25]  Christoph Herrmann,et al.  An Investigation into Fixed Energy Consumption of Machine Tools , 2011 .

[26]  Abolfazl Mirzazadeh,et al.  The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches , 2012 .

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

[28]  Isao Ono,et al.  A genetic algorithm for job-shop scheduling problems using job-based order crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[30]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .

[31]  John W. Sutherland,et al.  A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction , 2011 .

[32]  Reza Tavakkoli-Moghaddam,et al.  A general flow shop scheduling problem with consideration of position-based learning effect and multiple availability constraints , 2014 .