A genetic algorithm for flow shop scheduling problems


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

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, vol.55, no.8, pp.830-835, 2004 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 55 Issue: 8
  • Publication Date: 2004
  • Doi Number: 10.1057/palgrave.jors.2601766
  • Journal Name: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Page Numbers: pp.830-835
  • Keywords: genetic algorithms, scheduling, sequencing, HEURISTIC ALGORITHM, SEQUENCING PROBLEM, M-MACHINE, N-JOB, MINIMIZATION
  • Gazi University Affiliated: Yes

Abstract

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).