A HYBRIT APPROACH ON SINGLE SERVER PARALLEL MACHINES SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES

Tuerker A. K., Sel C.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.26, sa.4, ss.731-740, 2011 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 26 Sayı: 4
  • Basım Tarihi: 2011
  • Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.731-740
  • Anahtar Kelimeler: Parallel machine scheduling, Sequence dependent setup times, Single server, Genetic algorithm, Tabu search, TABU SEARCH, JOBS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Ö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.