AN APPLICATION OF EFFECTIVE GENETIC ALGORITHMS FOR SOLVING HYBRID FLOW SHOP SCHEDULING PROBLEMS

Creative Commons License

Kahraman C., Engin O., KAYA İ., Yılmaz M. K.

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, cilt.1, sa.2, ss.134-147, 2008 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 1 Sayı: 2
  • Basım Tarihi: 2008
  • Doi Numarası: 10.2991/ijcis.2008.1.2.4
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.134-147
  • Anahtar Kelimeler: Hybrid flow shop scheduling, Genetic algorithm, completion time, BOUND ALGORITHM, 2-STAGE, BRANCH
  • Yıldız Teknik Üniversitesi Adresli: Hayır

Özet

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carlier and Neron's (2000) benchmark problem from the literature. The computational results indicate that the proposed efficient genetic algorithm approach is effective in terms of reduced total completion time or makespan (C-max) for HFS problems.