Parallel robot scheduling to minimize mean tardiness with precedence constraints using a genetic algorithm

Identical parallel robot scheduling problem for minimizing mean tardiness with precedence constraints is a very important scheduling problem. But, the solution of this problem becomes much difficult when there are a number of robots, jobs and precedence constraints. Genetic algorithm is an efficient tool in the solution of combinatorial optimization problems, as it is well known. In this study, a genetic algorithm is used to schedule jobs that have precedence constraints minimizing the mean tardiness on identical parallel robots. The solutions of problems, which have been taken in different scales, have been done using simulated annealing and genetic algorithm. In particular, genetic algorithm is found noteworthy successful in large-scale problems.

[1]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[2]  Yih-Long Chang,et al.  Heuristics for minimizing mean tardiness form parallel machines , 1991 .

[3]  Bahram Alidaee,et al.  Scheduling parallel machines to minimize total weighted and unweighted tardiness , 1997, Comput. Oper. Res..

[4]  M. Azizoglu,et al.  Tardiness minimization on parallel machines , 1998 .

[5]  Esther M. Arkin,et al.  Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..

[6]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[7]  Vinícius Amaral Armentano,et al.  Tabu search for scheduling on identical parallel machines to minimize mean tardiness , 2000, J. Intell. Manuf..

[8]  Christos Koulamas.  Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .

[9]  Michael Pinedo,et al.  Scheduling stochastic jobs with due dates on parallel machines , 1990 .

[10]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[11]  Hironori Kasahara,et al.  Parallel processing of robot-arm control computation on a multimicroprocessor system , 1985, IEEE J. Robotics Autom..

[12]  Wu Cheng,et al.  A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines , 1999, Artif. Intell. Eng..

[13]  Nikos A. Aspragathos,et al.  Optimal robot task scheduling based on genetic algorithms , 2005 .

[14]  C. L. Philip Chen,et al.  Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system , 1988, IEEE Trans. Syst. Man Cybern..

[15]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[16]  Alain Guinet.  Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria , 1995, J. Intell. Manuf..

[17]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[18]  C. L. Philip Chen,et al.  Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[19]  Johannes M.J. Schutten,et al.  Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[20]  Hajime Ase,et al.  Robust Scheduling in a Multi-Robot Welding System , 2003 .

[21]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .