A genetic algorithm for flow shop scheduling problems

Etiler O., Toklu B., Atak M., Wilson J.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.55, sa.8, ss.830-835, 2004 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 55 Sayı: 8
  • Basım Tarihi: 2004
  • Doi Numarası: 10.1057/palgrave.jors.2601766
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.830-835
  • Anahtar Kelimeler: genetic algorithms, scheduling, sequencing, HEURISTIC ALGORITHM, SEQUENCING PROBLEM, M-MACHINE, N-JOB, MINIMIZATION
  • Gazi Üniversitesi Adresli: Evet

Özet

Many scheduling problems are NP-hard problems. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we develop a genetic algorithm-based heuristic for the flow shop scheduling problem with makespan as the criterion. The performance of the algorithm is compared with the established NEH algorithm. Computational experience indicates that genetic algorithms can be good techniques for flowshop scheduling problems. Journal of the Operational Research Society (2004).