Memetic algorithm for unrelated parallel machine scheduling problem with grey processing times

Basit Öğe Kaydı
dc.authoridArik, Oguzhan Ahmet/0000-0002-7088-2104
dc.contributor.authorArık, Oğuzhan Ahmet
dc.date.accessioned2025-02-24T17:18:32Z
dc.date.available2025-02-24T17:18:32Z
dc.date.issued2023
dc.departmentFakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü
dc.description.abstractPurpose This paper aims to provide a promising memetic algorithm (MA) for an unrelated parallel machine scheduling problem with grey processing times by using a simple dispatching rule in the local search phase of the proposed MA. Design/methodology/approach This paper proposes a MA for an unrelated parallel machine scheduling problem where the objective is to minimize the sum of weighted completion times of jobs with uncertain processing times. In the optimal schedule of the problem's single machine version with deterministic processing time, the machine has a sequence where jobs are ordered in their increasing order of weighted processing times. The author adapts this property to some of their local search mechanisms that are required to assure the local optimality of the solution generated by the proposed MA. To show the efficiency of the proposed algorithm, this study uses other local search methods in the MA within this experiment. The uncertainty of processing times is expressed with grey numbers. Findings Experimental study shows that the MA with the swap-based local search and the weighted shortest processing time (WSPT) dispatching rule outperforms other MA alternatives with swap-based and insertion-based local searches without that dispatching rule. Originality/value A promising and effective MA with the WSPT dispatching rule is designed and applied to unrelated parallel machine scheduling problems where the objective is to minimize the sum of the weighted completion times of jobs with grey processing time.
dc.identifier.doi10.1108/JM2-01-2022-0014
dc.identifier.endpage1602
dc.identifier.issn1746-5664
dc.identifier.issn1746-5672
dc.identifier.issue5
dc.identifier.scopus2-s2.0-85131827586
dc.identifier.scopusqualityQ2
dc.identifier.startpage1584
dc.identifier.urihttps://doi.org/10.1108/JM2-01-2022-0014
dc.identifier.urihttps://hdl.handle.net/20.500.14440/734
dc.identifier.volume18
dc.identifier.wosWOS:000810568300001
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorArik, Oguzhan Ahmet
dc.language.isoen
dc.publisherEmerald Group Publishing Ltd
dc.relation.ispartofJournal of Modelling in Management
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20250201
dc.subjectMemetic algorithm
dc.subjectGrey processing time
dc.subjectUnrelated parallel machine
dc.subjectWeighted completion times
dc.titleMemetic algorithm for unrelated parallel machine scheduling problem with grey processing times
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu