Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem

Kellegoez T., TOKLU B., Wilson J.

APPLIED MATHEMATICS AND COMPUTATION, cilt.199, sa.2, ss.590-598, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 199 Sayı: 2
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1016/j.amc.2007.10.013
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.590-598
  • Anahtar Kelimeler: genetic algorithms, one-machine scheduling, total weighted tardiness, crossover operators, SCHEDULING PROBLEM, ALGORITHM, MINIMIZE
  • Gazi Üniversitesi Adresli: Evet

Özet

In this study, the well-known one machine problem with the performance criterion of minimizing total weighted tardiness is considered. This problem is known to be NP-hard, and consists of one machine and n independent jobs. Each of these jobs has a distinct integer processing time, a distinct integer weighting factor, and a distinct integer due date. The purpose of this problem is to find a sequence of these jobs minimizing the sum of the weighted tardiness. Using benchmarking problems, this study compares performances of eleven genetic crossover operators which have been widely used to solve other types of hard scheduling problems. (c) 2007 Elsevier Inc. All rights reserved.