Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints

Global warming and climate change are threatening life on earth. These changes are due to human activities resulting in the emission of greenhouse gases. This is caused by intensive industrial activities and excessive fuel energy consumption. Recently, the scheduling of production systems has been judged to be an effective way to reduce energy consumption. This is the field of green scheduling, which aims to allocate jobs to machines in order to minimize total costs, with a focus on the sustainable use of energy. Several studies have investigated parallel-machine shops, with a special focus on reducing and minimizing the total consumed energy. Few studies explicitly include the idle energy of parallel machines, which is the energy consumed when the machines are idle. In addition, very few studies have considered the elimination of idle machine times as an efficient way to reduce the total consumed energy. This is the no-idle machine constraint, which is the green aspect of the research. In this context, this paper addresses the green parallel-machine scheduling problem, including release dates, delivery times, and no-idle machines, with the objective of minimizing the maximum completion time. This problem is of practical interest since it is encountered in several industry processes, such as the steel and automobile industries. A mixed-integer linear programming (MILP) model is proposed for use in obtaining exact solutions for small-sized instances. Due to the NP-hardness of the studied problem, and encouraged by the successful adaptation of metaheuristics for green scheduling problems, three genetic algorithms (GAs) using three different crossover operators and a simulated annealing algorithm (SA) were developed for large-sized problems. A new family of lower bounds is proposed. This was intended for the evaluation of the performance of the proposed algorithms over the average percent of relative deviation (ARPD). In addition, the green aspect was evaluated over the percentage of saved energy, while eliminating the idle-machine times. An extensive experimental study was carried out on a benchmark of test problems with up to 200 jobs and eight machines. This experimental study showed that one GA variant dominated the other proposed procedures. Furthermore, the obtained numerical results provide strong evidence that the proposed GA variant outperformed the existing procedures from the literature. The experimental study also showed that the adoption of the no-idle machine time constraints made it possible to reduce the total consumed energy by 29.57%, while the makespan (cost) increased by only 0.12%.

[1]  Alain Quilliot,et al.  No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines , 2021, Comput. Oper. Res..

[2]  Leonid Sheremetov,et al.  Two-stage genetic algorithm for parallel machines scheduling problem: Cyclic steam stimulation of high viscosity oil reservoirs , 2018, Appl. Soft Comput..

[3]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[4]  Marco Antonio Moreira de Carvalho,et al.  Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints , 2020, Eur. J. Oper. Res..

[5]  Pei-Wei Tsai,et al.  Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization , 2020 .

[6]  Christos D. Tarantilis,et al.  Energy-aware decision support for production scheduling , 2017, Decis. Support Syst..

[7]  Claver Diallo,et al.  Makespan minimization for parallel machines scheduling with multiple availability constraints , 2014, Ann. Oper. Res..

[8]  István Módos,et al.  Algorithms for robust production scheduling with energy consumption limits , 2017, Comput. Ind. Eng..

[9]  Premysl Sucha,et al.  A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace , 2020, Comput. Oper. Res..

[10]  Ali Sadollah,et al.  A review of energy-efficient scheduling in intelligent production systems , 2019, Complex & Intelligent Systems.

[11]  Patrick Siarry,et al.  An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem , 2019, Swarm Evol. Comput..

[12]  Ilkyeong Moon,et al.  Direct shipping service routes with an empty container management strategy , 2018, Transportation Research Part E: Logistics and Transportation Review.

[13]  Deming Lei,et al.  A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption , 2017, Int. J. Prod. Res..

[14]  Pei-Chann Chang,et al.  Two-phase sub population genetic algorithm for parallel machine-scheduling problem , 2005, Expert Syst. Appl..

[15]  Massimo Paolucci,et al.  A bi-objective heuristic approach for green identical parallel machine scheduling , 2021, Eur. J. Oper. Res..

[16]  Premysl Sucha,et al.  On Idle Energy Consumption Minimization in Production: Industrial Example and Mathematical Model , 2020, ICORES.

[17]  He Yan,et al.  A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan , 2005 .

[18]  Ghasem Moslehi,et al.  Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs , 2020 .

[19]  Khaled Ghédira,et al.  Scheduling Jobs with Releases Dates and Delivery Times on M Identical Non-idling Machines , 2017, ICINCO.

[20]  Mitsuo Gen,et al.  A parallel multi-objective genetic algorithm with learning based mutation for railway scheduling , 2019, Comput. Ind. Eng..

[21]  Yan Wang,et al.  A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines , 2020, Expert Syst. Appl..

[22]  Deming Lei,et al.  An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance , 2020, Comput. Ind. Eng..

[23]  Lotfi Hidri,et al.  Bounding Strategies for the Parallel Processors Scheduling Problem With No-Idle Time Constraint, Release Date, and Delivery Time , 2019, IEEE Access.

[24]  Jing Xiao,et al.  A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times , 2015, Comput. Oper. Res..

[25]  Ywh-Leh Chou,et al.  An energy-aware scheduling algorithm under maximum power consumption constraints , 2020 .

[26]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[27]  Mehmet Bayram Yildirim,et al.  A framework to minimise total energy consumption and total tardiness on a single machine , 2008 .

[28]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[29]  István Módos,et al.  On parallel dedicated machines scheduling under energy consumption limit , 2021, Comput. Ind. Eng..

[30]  Panos M. Pardalos,et al.  Green manufacturing: Order acceptance and scheduling subject to the budgets of energy consumption and machine launch , 2020 .

[31]  Behrooz Koohestani,et al.  A crossover operator for improving the efficiency of permutation-based genetic algorithms , 2020, Expert Syst. Appl..

[32]  Alicia Troncoso Lora,et al.  Application of Evolutionary Computation Techniques to the Optimal Short-Term Scheduling of the Electrical Energy Production , 2003, Conferencia de la Asociación Española para la Inteligencia Artificial.

[33]  Adil Baykasoğlu,et al.  Dynamic scheduling of parallel heat treatment furnaces: A case study at a manufacturing system , 2018 .

[34]  Subrata Saha,et al.  Fuzzy Bi-Objective Production-Distribution Planning Problem under the Carbon Emission Constraint , 2016 .

[35]  Hicham Chehade,et al.  Theoretical Analysis of Workload Imbalance Minimization Problem on Identical Parallel Machines , 2016, ACIIDS.

[36]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[37]  V. Selladurai,et al.  Workflow balancing in parallel machines through genetic algorithm , 2007 .

[38]  Mohamed Abdel-Basset,et al.  A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem , 2021, Mathematics.

[39]  Joseph Y.-T. Leung,et al.  Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines , 2017, Appl. Soft Comput..

[40]  Derya Eren Akyol,et al.  Minimizing Makespan on Identical Parallel Machines Using Neural Networks , 2006, ICONIP.

[41]  John H. Holland,et al.  Genetic Algorithms and Adaptation , 1984 .

[42]  Joseph Y.-T. Leung,et al.  Parallel machine scheduling problems in green manufacturing industry , 2016 .

[43]  Shengchao Zhou,et al.  A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes , 2018, Appl. Math. Comput..

[44]  Mitsuo Gen,et al.  Parallel machine scheduling problems using memetic algorithms , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[45]  Mohd Abdul Hameed,et al.  Relative performance of Roulette wheel GA and Rank GA is dependent on chromosome parity , 2021 .

[46]  Xiaodong Wang,et al.  Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan , 2018, Journal of Cleaner Production.

[47]  Haidong Yang,et al.  An Ant Optimization Model for Unrelated Parallel Machine Scheduling with Energy Consumption and Total Tardiness , 2015 .

[48]  Antonios Antoniadis,et al.  Parallel Machine Scheduling to Minimize Energy Consumption , 2019, SODA.

[49]  Katie McConky,et al.  Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing , 2019, Journal of Cleaner Production.

[50]  Seyed Taghi Akhavan Niaki,et al.  Bi-objective green scheduling in uniform parallel machine environments , 2019, Journal of Cleaner Production.

[51]  Ada Che,et al.  A memetic differential evolution algorithm for energy-efficient parallel machine scheduling , 2019, Omega.

[52]  Federico Della Croce,et al.  Minimizing total completion time in the two-machine no-idle no-wait flow shop problem , 2019, J. Heuristics.

[53]  Rui Xu,et al.  Minimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach , 2008, 2008 3rd IEEE Conference on Industrial Electronics and Applications.

[54]  T. Warren Liao,et al.  Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness , 2017, Appl. Soft Comput..

[55]  Lin Li,et al.  Optimal production scheduling for energy efficiency improvement in biofuel feedstock preprocessing considering work-in-process particle separation , 2016 .

[56]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .