Hybrid Evolutionary Algorithm for job scheduling under machine maintenance

The job scheduling problem (JSP) belongs to the well-known combinatorial optimization domain. After scheduling, if a machine maintenance issue affects the scheduled processing of jobs, the delivery of jobs must be delayed. In this paper, we have first proposed a Hybrid Evolutionary Algorithm (HyEA) for solving JSPs. We have then analyzed the effect of machine maintenance, whether preventive or breakdown, on the job scheduling. For the breakdown maintenance case, it is required to revise the algorithm to incorporate a rescheduling option after the breakdown occurs. The algorithm has been tested by solving a number of benchmark problems and thence comparing them with the existing algorithms. The experimental results provide a better understanding of job scheduling and the necessary rescheduling operations under process interruption.

[1]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[2]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[3]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[4]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[5]  Felix T.S. Chan,et al.  Comparative performance analysis of a flexible manufacturing system (FMS): a review-period-based control , 2008 .

[6]  山田 武士,et al.  Studies on metaheuristics for jobshop and flowshop scheduling problems , 2003 .

[7]  Amritpal Singh Raheja,et al.  Reactive repair tool for job shop schedules , 2005 .

[8]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[9]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[10]  Jan Paredis,et al.  Exploiting Constraints as Background Knowledge for Genetic Algorithms: A Case-Study for Scheduling , 1992, PPSN.

[11]  Y Takeshi,et al.  GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING PROBLEMS , 1997 .

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

[13]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[14]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[15]  Ruhul A. Sarker,et al.  Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns , 2011 .

[16]  P. Aravindan,et al.  Comparative evaluation of genetic algorithms for job-shop scheduling , 2001 .

[17]  Tarek Y. ElMekkawy,et al.  A generic deadlock-free reactive scheduling approach , 2009 .

[18]  Charles S. Newton,et al.  Evolutionary Optimization (Evopt): A Brief Review And Analysis , 2003, Int. J. Comput. Intell. Appl..

[19]  H. L. Ong,et al.  Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem , 2004, Adv. Eng. Softw..

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

[21]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[22]  K. R. Baker,et al.  An Analytic Framework for Evaluating Rolling Schedules , 1979 .

[23]  Tapabrata Ray,et al.  Optimum Oil Production Planning Using Infeasibility Driven Evolutionary Algorithm , 2013, Evolutionary Computation.

[24]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .