A client/server-based parallel coevolutionary algorithm for parallel machines scheduling problem with penalties

A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aims at minimizing the total tardiness penalty costs of all jobs is considered. The decomposition and combination characteristics of the problem are studied. Based on these two characteristics, a parallel coevolutionary algorithm (PCA) is proposed. The PCA is implemented in a client/server (C/S)-based parallel coevolutionary computation structure, in which the server is responsible for global evolution by task assignment and the client is responsible for local evolution by task ordering. According to this structure, a genetic algorithm and a virus evolutionary genetic algorithm are developed, which are executed on server and client, respectively. The simulated experiments are designed, the comparison results with adapted algorithms show that the proposed algorithm C/S-PCA has superior performances both in convergence speed and in searching optimality.

[1]  Naoyuki Kubota,et al.  Schema representation in virus-evolutionary genetic algorithm for knapsack problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  Zhi-Long Chen,et al.  Parallel machine scheduling with a common due window , 2002, Eur. J. Oper. Res..

[3]  John W. Fowler,et al.  Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems , 2011, Comput. Oper. Res..

[4]  Andrea Rossi,et al.  A hybrid heuristic to solve the parallel machines job-shop scheduling problem , 2009, Adv. Eng. Softw..

[5]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[6]  Ching-Jong Liao,et al.  Single machine scheduling problem with fuzzy due date and processing time , 1998 .

[7]  Sang-Oh Shim,et al.  Generating subproblems in branch and bound algorithms for parallel machines scheduling problem , 2009, Comput. Ind. Eng..

[8]  Toshio Fukuda,et al.  The role of virus infection in virus-evolutionary genetic algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  Taho Yang,et al.  An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study , 2009, Comput. Ind. Eng..

[10]  Rym M'Hallah,et al.  A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity , 2011, Comput. Oper. Res..

[11]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[12]  Vinícius Amaral Armentano,et al.  A heuristic for single machine scheduling with early and tardy costs , 2001, Eur. J. Oper. Res..

[13]  Mitsuo Gen,et al.  Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms , 1995 .

[14]  Antoine Jouglet,et al.  Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates , 2011, Comput. Oper. Res..

[15]  Gur Mosheiov,et al.  A common due-date assignment problem on parallel identical machines , 2001, Comput. Oper. Res..

[16]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .