Ant colony optimization for the job rotation scheduling problem

ULUSAM SEÇKİNER S., KURT M.

APPLIED MATHEMATICS AND COMPUTATION, cilt.201, ss.149-160, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 201
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1016/j.amc.2007.12.006
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.149-160
  • Gazi Üniversitesi Adresli: Evet

Özet

This paper seeks to explore the effectiveness of ant colony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the workload of jobs. The performances of the proposed two ant-colony algorithms are evaluated based on integer programming and simulated annealing solutions. Results show that the ant-colony algorithm implementation is able to compete effectively with the best known solution to the problem. (C) 2007 Elsevier Inc. All rights reserved.