Variable neighbourhood search for job shop scheduling problems

Sevkli M., Aydin M. E.

Journal of Software, cilt.1, sa.2, ss.34-39, 2006 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 1 Sayı: 2
  • Basım Tarihi: 2006
  • Doi Numarası: 10.4304/jsw.1.2.34-39
  • Dergi Adı: Journal of Software
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.34-39
  • Anahtar Kelimeler: Job shop scheduling, Variable neighbourhood search
  • İstanbul Ticaret Üniversitesi Adresli: Hayır

Özet

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried out. In this paper, an investigation on implementing VNS for job shop scheduling problems is carried out tackling benchmark suites collected from OR library. The idea is to build the best local search and shake operations based on neighbourhood structure available. The results are presented and compared with the recent approaches in the literature. It is concluded that the VNS algorithm can generally find better results. © 2006 ACADEMY PUBLISHER.