An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem

Nasr Al-Hinai*, T. Y. Elmekkawy

*Corresponding author for this work

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

The work presented in this paper proposes hybridized genetic algorithm architecture for the Flexible Job Shop Scheduling Problem (FJSP). The efficiency of the genetic algorithm is enhanced by integrating it with an initial population generation algorithm and a local search method. The usefulness of the proposed methodology is illustrated with the aid of an extensive computational study on 184 benchmark problems with the objective of minimizing the makespan. Results highlight the ability of the proposed algorithm to first obtain optimal or near-optimal solutions, and second to outperform or produce comparable results with these obtained by other best-known approaches in literature.

Original languageEnglish
Pages (from-to)64-85
Number of pages22
JournalFlexible Services and Manufacturing Journal
Volume23
Issue number1
DOIs
Publication statusPublished - Mar 2011

Keywords

  • Flexible job shop
  • Genetic algorithms
  • Local search
  • Meta heuristic approaches
  • Scheduling problems

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem'. Together they form a unique fingerprint.

  • Cite this