Hybrid solution algorithms for task scheduling problem with moving executors

Heuristic algorithms for solving the task scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated. Three hybrid solution algorithms are introduced. As a basis an evolutionary algorithm is assumed that is combined with the procedure that uses simulated annealing metaheuristics. The results of simulation experiments are given in which the influence of parameters of the solution algorithms as well as of the number of tasks on the quality of scheduling and on the time of computation is investigated.

[1]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[2]  Yee Leung,et al.  Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis , 1997, IEEE Trans. Neural Networks.

[3]  André Langevin,et al.  A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows , 1990, Networks.

[4]  Jerzy Józefczyk.  An Algorithm for Scheduling Tasks on Moving Executors in Complex Operation System , 1997 .

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms Plus Data Structures Equals Evolution Programs , 1994 .

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[8]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[9]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[10]  Chak-Kuen Wong,et al.  A new model of simulated evolutionary computation-convergence analysis and specifications , 2001, IEEE Trans. Evol. Comput..

[11]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[12]  J. Józefczyk.  Application of genetic algorithms for solving the scheduling problem with moving executors , 2001 .

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[14]  Jerzy Józefczyk.  Scheduling tasks on moving executors to minimise the maximum lateness , 2001, Eur. J. Oper. Res..

[15]  Chandrasekharan Rajendran,et al.  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times , 2003, Eur. J. Oper. Res..

[16]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[17]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[18]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[21]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[22]  Marvin D. Troutt,et al.  Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..

[23]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[24]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[25]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[26]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[27]  Oded Berman,et al.  A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems , 1999, Oper. Res..

[28]  J. Józefczyk.  New algorithms for solving the tasks scheduling problems in discrete manufacturing systems , 2003 .

[29]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.