A variable neighbourhood search algorithm for job shop scheduling problems

Sevkli M., Aydin M. E.

6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, Budapest, Macaristan, 10 - 12 Nisan 2006, cilt.3906 LNCS, ss.261-271, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 3906 LNCS
  • Doi Numarası: 10.1007/11730095_22
  • Basıldığı Şehir: Budapest
  • Basıldığı Ülke: Macaristan
  • Sayfa Sayıları: ss.261-271
  • İstanbul Ticaret Üniversitesi Adresli: Hayır

Özet

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood within a local search is carried out. In this paper, a variable neighbourhood search algorithm is proposed for Job Shop Scheduling (JSS) problem with makespan criterion. The results gained by VNS algorithm are presented and compared with the best known results in literature. It is concluded that the VNS implementation is better than many recently published works with respect to the quality of the solution. © Springer-Verlag Berlin Heidelberg 2006.