Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server

dc.authoridSel, Cagri/0000-0002-8657-2303
dc.contributor.authorTurker, A. Kursad
dc.contributor.authorSel, Cagri
dc.date.accessioned2025-01-21T16:44:19Z
dc.date.available2025-01-21T16:44:19Z
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 makespan 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.
dc.identifier.endpage123
dc.identifier.issn2147-1762
dc.identifier.issue1
dc.identifier.scopusqualityQ2
dc.identifier.startpage113
dc.identifier.urihttps://hdl.handle.net/20.500.12587/25426
dc.identifier.volume24
dc.identifier.wosWOS:000421116000015
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherGazi Univ
dc.relation.ispartofGazi University Journal of Science
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_20241229
dc.subjectParallel Machine Scheduling; Genetic Algorithm; Permutation Algorithm
dc.titleScheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server
dc.typeArticle

Dosyalar