Tabu Search for Parallel Machine Scheduling with Job Splitting

Celik C., SARIÇİÇEK İ.

6th International Conference on Information Technology - New Generations (ITNG 2009), Nevada, Amerika Birleşik Devletleri, 27 - 29 Nisan 2009, ss.183-188 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/itng.2009.271
  • Basıldığı Şehir: Nevada
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.183-188
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

In this paper, we focus on the problem of scheduling on m identical parallel machines with job splitting property. It is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. The problem is solved by a tabu search algorithm. The performance of the algorithm is tested on random generated problems with different sizes. The results are compared with those of the mathematical model. Results of the experiments show that the suggested Tabu Search algorithm gives better solutions to the problems in a reasonable amount of computation time.