GA with priority rules for solving Job-Shop Scheduling Problems

The Job-Shop Scheduling Problem (JSSP) is considered as one of the difficult combinatorial optimization problems and treated as a member of NP-complete problem class. In this paper, we consider JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. First, we develop a genetic algorithm (GA) based approach for solving JSSPs. We then introduce a number of priority rules such as partial reordering, gap reduction and restricted swapping to improve the performance of the GA. We run the GA incorporating these rules in a number of different ways. We solve 40 benchmark problems and compared their results with that of a number of well-known algorithms. We obtain optimal solutions for 27 problems, and the overall performance of our algorithms is quite encouraging.

[1]  John E. Biegel,et al.  Genetic algorithms and job shop scheduling , 1990 .

[2]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[3]  J. Carlier.  The one-machine sequencing problem , 1982 .

[4]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

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

[6]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[7]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

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

[10]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[11]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[12]  Said Ashour,et al.  A branch-and-bound approach to the job-shop scheduling problem , 1973 .

[13]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[14]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[15]  Wenjia Wang,et al.  An effective genetic algorithm for job shop scheduling , 2000 .

[16]  Ruhul A. Sarker,et al.  Hybrid Genetic Algorithm for Solving Job-Shop Scheduling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[17]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[18]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[19]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[20]  Ruhul A. Sarker,et al.  Modified genetic algorithm for job-shop scheduling: A gap utilization technique , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

[22]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  P. Aravindan,et al.  A Tabu Search Algorithm for Job Shop Scheduling , 2000 .

[25]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[26]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[27]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

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

[29]  Jan Paredis,et al.  Exploiting constraints as background knowledge for evolutionary algorithms , 1997 .

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

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

[32]  N. Jawahar,et al.  A simulated annealing algorithm for job shop scheduling , 1999 .

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

[34]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[35]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

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

[37]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .