A new heuristic for the queries scheduling problem on distributed database systems to minimize mean completion time

Allahverdi A., Al-Anzi F. S.

21st International Conference on Software Engineering and Data Engineering, SEDE 2012, Los Angeles, CA, Amerika Birleşik Devletleri, 27 - 29 Haziran 2012, ss.93-97 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Los Angeles, CA
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.93-97
  • Anahtar Kelimeler: Assembly flowshop, Database, Heuristic, Scheduling
  • Gazi Üniversitesi Adresli: Hayır

Özet

We address the two-stage multi-machine assembly scheduling problem to minimize mean completion times of all jobs. This problem has many applications in practice including the queries scheduling on distributed database systems This problem has been recently addressed in the literature for which an efficient heuristic, called SAK, was developed for the case when m=2. In this paper, we address the problem for the case m=2. We propose a hybrid tabu search (HTS) heuristic and show that the overall average error of SAK is more than twice that of HTS while the average CPU time of SAK is five times that of HTS. This clearly indicates that the heuristic HTS is much better than the only existing heuristic available for the problem, i.e., SAK.