Engineering Sciences

Engineering Sciences

ERKEN VE GEÇ CEZALI PERMÜTASYON AKI? TYPY ÇYZELGELEME PROBLEMLERYNYN DA?INIK ARAMA METASEZGYSELY YLE ÇÖZÜMÜ

Yazarlar: Ömer AKGÖBEK, Serkan KAYA, Orhan ENGİN

Cilt 6 , Sayı 1 , 2011 , Sayfalar 415 - 420

Konular:-

DOI:10.12739/nwsaes.v6i1.5000067044

Anahtar Kelimeler:EARLINESS AND TARDINESS PENALTIES,PERMUTATION FLOW SHOP,SCATTER SEARCH,METAHEURISTIC METHODS,BENCHMARK PROBLEMS

Özet: In a permutation flow shop scheduling problem, n independent jobs have to be processed in the same order on m different machines. In this study, the permutation flow shop scheduling problem with earliness and tardiness penalties and common due date for jobs is considered. The permutation flow shop scheduling with earliness and tardiness penalties is known NP-hard problem. A scatter search which known a metaheuristic method is used to solve this permutation flow shop scheduling problem. A benchmark permutation flow shop scheduling with earliness and tardiness penalties and common due date problem is solved by proposed scatter search method.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2011, title={ERKEN VE GEÇ CEZALI PERMÜTASYON AKI? TYPY ÇYZELGELEME PROBLEMLERYNYN DA?INIK ARAMA METASEZGYSELY YLE ÇÖZÜMÜ}, volume={6}, number={415–420}, publisher={Engineering Sciences}, author={Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN}, year={2011} }
APA
KOPYALA
Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN. (2011). ERKEN VE GEÇ CEZALI PERMÜTASYON AKI? TYPY ÇYZELGELEME PROBLEMLERYNYN DA?INIK ARAMA METASEZGYSELY YLE ÇÖZÜMÜ (Vol. 6). Vol. 6. Engineering Sciences.
MLA
KOPYALA
Ömer AKGÖBEK,Serkan KAYA,Orhan ENGİN. ERKEN VE GEÇ CEZALI PERMÜTASYON AKI? TYPY ÇYZELGELEME PROBLEMLERYNYN DA?INIK ARAMA METASEZGYSELY YLE ÇÖZÜMÜ. no. 415–420, Engineering Sciences, 2011.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri