Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
Yükleniyor...
Tarih
2008
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science Inc
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
Anahtar Kelimeler
genetic algorithms, one-machine scheduling, total weighted tardiness, crossover operators
Kaynak
Applied Mathematics And Computation
WoS Q Değeri
Q2
Scopus Q Değeri
Q1
Cilt
199
Sayı
2
Künye
closedAccess
