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.
|الصفحات (من إلى)||64-85|
|دورية||Flexible Services and Manufacturing Journal|
|المعرِّفات الرقمية للأشياء|
|حالة النشر||Published - مارس 2011|
ASJC Scopus subject areas