Scheduling two parallel machines with sequence-dependent setups and a single server

Basit Öğe Kaydı
dc.contributor.authorTurker A.K.
dc.contributor.authorSel C.
dc.date.accessioned2020-06-25T15:14:44Z
dc.date.available2020-06-25T15:14:44Z
dc.date.issued2011
dc.departmentKırıkkale Üniversitesi
dc.description.abstractThis paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum make span of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2,S|STsd|Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2,S|STsd|Cmax problem.en_US
dc.identifier.endpage123en_US
dc.identifier.issn13039709
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-79551510085
dc.identifier.scopusqualityQ2
dc.identifier.startpage113en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12587/2185
dc.identifier.volume24en_US
dc.indekslendigikaynakScopus
dc.language.isoen
dc.relation.ispartofGazi University Journal of Science
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGenetic algorithmen_US
dc.subjectParallel machine schedulingen_US
dc.subjectPermutation algorithmen_US
dc.titleScheduling two parallel machines with sequence-dependent setups and a single serveren_US
dc.typeArticle

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu