Ana gezinime geç Aramaya geç Ana içeriğe geç

A scatter search method for fuzzy job shop scheduling problem with availability constraints

  • Orhan Engin*
  • , M. Kerim Yilmaz
  • , Cengiz Kahraman
  • , M. Emin Baysal
  • , Ahmet Sarucan
  • *Bu çalışma için yazışmadan sorumlu yazar

Araştırma sonucu: Kitap/Rapor/Konferans Bildirisinde BölümKonferans katkısıbilirkişi

3 Atıf (Scopus)

Özet

In the last decade job shop scheduling problems have been subject to intensive research due to their multiple applications. Job shop scheduling is known as a strongly NP-complete problem. In the job shop scheduling problems, processing times and due dates are very dynamically due to both human and machine resource factors. Fuzzy sets are used to model the uncertain processing times and due dates in recent years. In this study, a fuzzy job shop scheduling problem with availability constraints is considered. A Scatter Search (SS) method is proposed to solve these problems. The feasibility and effectiveness of the proposed scatter search method is demonstrated by comparing it with the hybrid genetic algorithm (HGA).

Orijinal dilİngilizce
Ana bilgisayar yayını başlığıProceedings of the World Congress on Engineering 2011, WCE 2011
Sayfalar1144-1148
Sayfa sayısı5
Yayın durumuYayınlandı - 2011
EtkinlikWorld Congress on Engineering 2011, WCE 2011 - London, United Kingdom
Süre: 6 Tem 20118 Tem 2011

Yayın serisi

AdıProceedings of the World Congress on Engineering 2011, WCE 2011
Hacim2

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???World Congress on Engineering 2011, WCE 2011
Ülke/BölgeUnited Kingdom
ŞehirLondon
Periyot6/07/118/07/11

Parmak izi

A scatter search method for fuzzy job shop scheduling problem with availability constraints' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap