Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems

In this paper, a genetic algorithm with injecting artificial chromosomes is developed to solve the single machine scheduling problems. Artificial chromosomes are generated according to a probability matrix which is transformed from the dominance matrix by mining the gene structure of an elite base. A roulette wheel selection method is applied to generate an artificial chromosome by assigning genes onto each position according to the probability matrix. The higher the probability is, the more possible that the job will show up in that particular position. By injecting these artificial chromosomes, the genetic algorithm will speed up the convergence of the evolutionary processes. Intensive experimental results indicate that proposed algorithm is very encouraging and it can improve the solution quality significantly.

[1]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[2]  M. Selim Akturk,et al.  Theory and Methodology a New Dominance Rule to Minimize Total Weighted Tardiness with Unequal Release Dates , 1998 .

[3]  Pei‐Chann Chang,et al.  A two‐phase approach for single machine scheduling problems: Minimizing the total absolute deviation , 1992 .

[4]  Patrik D'haeseleer,et al.  Context preserving crossover in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[6]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[7]  Ching-Fang Liaw,et al.  A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..

[8]  Pei-Chann Chang,et al.  Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs , 2001 .

[9]  M. Azizoglu,et al.  Bicriteria scheduling problem involving total tardiness and total earliness penalties , 1991 .

[10]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[11]  Francis Sourd,et al.  An efficient algorithm for the earliness-tardiness scheduling problem , 2005 .

[12]  Zafer Bingul,et al.  Adaptive genetic algorithms applied to dynamic multiobjective problems , 2007, Appl. Soft Comput..

[13]  L. Darrell Whitley,et al.  Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.

[14]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[15]  Kyung-shik Shin,et al.  A hybrid approach based on neural networks and genetic algorithms for detecting temporal patterns in stock markets , 2007, Appl. Soft Comput..

[16]  George Z. Li.  Single machine earliness and tardiness scheduling , 1997 .

[17]  M. Senthil Arumugam,et al.  New hybrid genetic operators for real coded genetic algorithm to compute optimal control of a class of hybrid systems , 2005, Appl. Soft Comput..

[18]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

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

[20]  Kang Li.  A Gene-Based Genetic Algorithm for TSP , 2003 .

[21]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[22]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[23]  Pedro Larrañaga,et al.  GA-EDA: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms , 2004 .

[24]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

[25]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[26]  Pei-Chann Chang,et al.  Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times , 2003, Appl. Soft Comput..

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

[28]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[29]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[30]  Lothar Thiele,et al.  A Comparison of Selection Schemes used in Genetic Algorithms , 1995 .

[31]  Pei-Chann Chang.  A branch and bound approach for single machine scheduling with earliness and tardiness penalties , 1999 .

[32]  Jian Zhang,et al.  Mutation Matrix in Evolutionary Computation: An Application to Resource Allocation Problem , 2005, ICNC.

[33]  Melanie Mitchell,et al.  Genetic algorithms and artificial life , 1994 .

[34]  Pei-Chann Chang,et al.  A heuristic to minimize a quadratic function of job lateness on a single machine , 1998 .

[35]  Pei-Chann Chang,et al.  A case-injected genetic algorithm for single machine scheduling problems with release time , 2006 .

[36]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[37]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[38]  Pei-Chann Chang,et al.  Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems , 2007, Expert Syst. Appl..

[39]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[40]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[41]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[42]  Jorge M. S. Valente,et al.  Heuristics for the Early/Tardy Scheduling Problem with Release Dates , 2007 .

[43]  Chao-Xue Wang,et al.  A Novel Genetic Algorithm Based on Gene Therapy Theory , 2006 .

[44]  Jorge M. S. Valente,et al.  Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..

[45]  Pei-Chann Chang,et al.  A greedy heuristic for bicriterion single machine scheduling problems , 1992 .