A New Inter-island Genetic Operator for Optimization Problems with Block Properties

Combinatorial optimization problems of scheduling belongs in most cases to the NP-hard class. In this paper we propose a very effective method of construct parallel algorithms based on the island model of coevolutionary algorithm. We apply block properties, which enable the inter-island genetic operator to distribute calculations and shorten communication between processors.

[1]  W. Szwarc.  Adjacent orderings in single-machine scheduling with earliness and tardiness penalties , 1993 .

[2]  Noel M. Morris.  Programming and Applications , 1981 .

[3]  T. Yamada,et al.  Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[5]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for the Flow Shop Scheduling Problem , 2003, PPAM.

[6]  Theodore C. Belding,et al.  The Distributed Genetic Algorithm Revisited , 1995, ICGA.

[7]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[8]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[9]  Jae Young Choi,et al.  A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights , 1995, Comput. Oper. Res..

[10]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[11]  Wojciech Bozejko,et al.  Block approach - tabu search algorithm for single machine total weighted tardiness problem , 2006, Comput. Ind. Eng..

[12]  Mieczysław Wodecki,et al.  A Very Fast Tabu Search Algorithm for Job Shop Problem , 2005 .

[13]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[14]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for Minimizing Total Weighted Completion Time , 2004, ICAISC.

[15]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[16]  Candace Arai Yano,et al.  Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .

[17]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[18]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

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

[20]  Han Hoogeveen,et al.  A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time , 1996, INFORMS J. Comput..

[21]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[22]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[23]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[24]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .