A hybrit approach on single server parallel machines scheduling problem with sequence dependent setup times
[ X ]
Tarih
2011
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Gazi Univ, Fac Engineering Architecture
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this paper, a scheduling problem on two identical parallel machines with sequence-dependent setup times and setup operations that performed by a single server is considered. The main objective is to minimize the makespan of the schedule. For solution procedure, an algorithm combining genetic algorithm and tabu search methodology is proposed. Firstly, the algorithm finds an initial solution using genetic algorithm module. Then, tabu search module is applied to the solution of genetic algorithm in order to find better solution. The performance of the algorithm is analyzed by comparing the results with the random search results. It has been seen that the proposed algorithm is effective to solve P2,S vertical bar STsd vertical bar Cmax scheduling problem in reasonable time, and the results are close to optimum solution values.
Açıklama
Sel, Cagri/0000-0002-8657-2303
Anahtar Kelimeler
Parallel machine scheduling, Sequence dependent setup times, Single server, Genetic algorithm, Tabu search
Kaynak
Journal Of The Faculty Of Engineering And Architecture Of Gazi University
WoS Q Değeri
Q4
Scopus Q Değeri
Q2
Cilt
26
Sayı
4
Künye
closedAccess
