Engineering Sciences

Engineering Sciences

AÇIK ATÖLYE TYPY ÇYZELGELEME PROBLEMLERYNYN PARALEL DOYUMSUZ METASEZGYSEL ALGORYTMA YLE ÇÖZÜMÜ

Yazarlar: Ömer AKGÖBEK, Serkan KAYA, Orhan ENGİN, Ünal Değirmenci

Cilt 6 , Sayı 1 , 2011 , Sayfalar 421 - 427

Konular:-

DOI:10.12739/nwsaes.v6i1.5000067045

Anahtar Kelimeler:OPEN SHOP SCHEDULING,METAHEURISTIC METHODS,PARALLEL GREEDY ALGORITHM,BENCHMARK PROBLEMS,MAKESPAN

Özet: In a job shop each job has a fixed route that is predetermined. In practice, it often occurs that the route of the job is immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop (Pinedo, 2008). Lots types of open shop scheduling problems are known to be NP-hard. Open shop scheduling problem has received much attention due to its practical importance and lots of studies are made in the literature. In this study a parallel greedy metaheuristic algorithm (also known an artificial intelligence method) is proposed. The benchmark open shop scheduling problem is solved by proposed parallel greedy algorithm and the best results are researched.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2011, title={AÇIK ATÖLYE TYPY ÇYZELGELEME PROBLEMLERYNYN PARALEL DOYUMSUZ METASEZGYSEL ALGORYTMA YLE ÇÖZÜMÜ}, volume={6}, number={421–427}, publisher={Engineering Sciences}, author={Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN,Ünal Değirmenci}, year={2011} }
APA
KOPYALA
Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN,Ünal Değirmenci. (2011). AÇIK ATÖLYE TYPY ÇYZELGELEME PROBLEMLERYNYN PARALEL DOYUMSUZ METASEZGYSEL ALGORYTMA YLE ÇÖZÜMÜ (Vol. 6). Vol. 6. Engineering Sciences.
MLA
KOPYALA
Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN,Ünal Değirmenci. AÇIK ATÖLYE TYPY ÇYZELGELEME PROBLEMLERYNYN PARALEL DOYUMSUZ METASEZGYSEL ALGORYTMA YLE ÇÖZÜMÜ. no. 421–427, Engineering Sciences, 2011.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri