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

Cakar T., KOEKER R., DEMIR H. I.

ADVANCES IN ENGINEERING SOFTWARE, cilt.39, sa.1, ss.47-54, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 39 Sayı: 1
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1016/j.advengsoft.2006.11.003
  • Dergi Adı: ADVANCES IN ENGINEERING SOFTWARE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.47-54
  • İstanbul Teknik Üniversitesi Adresli: Hayır

Özet

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. (c) 2006 Elsevier Ltd. All rights reserved.