Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Wilson, John" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Yükleniyor...
    Küçük Resim
    Öğe
    Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
    (Elsevier Science Inc, 2008) Kellegoez, Talip; Toklu, Bilal; Wilson, John
    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.
  • Yükleniyor...
    Küçük Resim
    Öğe
    Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops
    (Pergamon-Elsevier Science Ltd, 2010) Kellegoz, Talip; Toklu, Bilal; Wilson, John
    In this research, a detailed study of the permutation flowshop scheduling problem with the objective of minimizing total tardiness is presented and a steady-state genetic algorithm solution procedure is developed for such problems. Also, using problem-specific knowledge, a very efficient elite guided solution improvement scheme and an appropriate crossover operator have been developed and integrated into the proposed method. Using benchmark problems, the algorithm has been compared with heuristic algorithms having the best performance in the literature. The performance of the developed algorithm is shown to be superior using a simulation study. (C) 2009 Elsevier Ltd. All rights reserved.

| Kırıkkale Üniversitesi | Kütüphane | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Kırıkkale Üniversitesi, Kırıkkale, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim