Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems


This paper proposes a modified version of the genetic algorithm for flexible job-shop scheduling problems (FJSP). The genetic algorithm (GA), a class of stochastic search algorithms, is very effective at finding optimal solutions to a wide variety of problems. The proposed modified GA consists of 1) an effective selection method called “fuzzy roulette wheel… (More)
DOI: 10.1016/j.procs.2012.09.041

5 Figures and Tables



Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics