Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorAlabas Uslu, Cigdem
dc.contributor.authorDengiz, Berna
dc.contributor.authorAglan, Canan
dc.contributor.authorSabuncuoglu, Ihsan
dc.date.accessioned2020-02-03T08:50:39Z
dc.date.available2020-02-03T08:50:39Z
dc.date.issued2019en_US
dc.identifier.issn1300-0632
dc.identifier.other1303-6203
dc.identifier.other10.3906/elk-1811-40
dc.identifier.urihttps://hdl.handle.net/20.500.12573/97
dc.description.abstractInterest in multiobjective permutation flow shop scheduling (PFSS) has increased in the last decade to ensure effective resource utilization. This study presents a modified self-adaptive local search (MSALS) algorithm for the biobjective permutation flow shop scheduling problem where both makespan and total flow time objectives are minimized. Compared to existing sophisticated heuristic algorithms, MSALS is quite simple to apply to different biobjective PFSS instances without requiring effort or time for parameter tuning. Computational experiments showed that MSALS is either superior to current heuristics for Pareto sets or is incomparable due to other performance indicators of multiobjective problems.en_US
dc.language.isoengen_US
dc.publisherTUBITAK SCIENTIFIC & TECHNICAL RESEARCH COUNCIL TURKEY, ATATURK BULVARI NO 221, KAVAKLIDERE, ANKARA, 00000, TURKEYen_US
dc.relation.ispartofseries27;
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBiobjective permutation flow shopen_US
dc.subjectself-adaptive heuristicen_US
dc.subjectparameter tuningen_US
dc.titleModified self-adaptive local search algorithm for a biobjective permutation flow shop scheduling problemen_US
dc.typearticleen_US
dc.contributor.departmentAGÜ, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.contributor.institutionauthor
dc.identifier.doi10.3906/elk-1811-40
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster