AN ENHANCED GENETIC ALGORITHM WITH AN INNOVATIVE ENCODING STRATEGY FOR FLEXIBLE JOB-SHOP SCHEDULING WITH OPERATION AND PROCESSING FLEXIBILITY

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

abstract. This paper considers the Flexible Job-shop Scheduling Problem with Operation and Processing flexibility (FJSP-OP) with the objective of minimizing the makespan. A Genetic Algorithm based approach is presented to solve the FJSP-OP. For the performance improvement, a new and concise Four-Tuple Scheme (FTS) is proposed for modeling a job with operation and processing flexibility. Then, with the FTS, an enhanced Genetic Algorithm employing a more efficient encoding strategy is developed. The use of this encoding strategy ensures that the classic genetic operators can be adopted to the utmost extent without generating infeasible offspring. Experiments have validated the proposed approach, and the results have shown the effectiveness and high performance of the proposed approach.

Cite

CITATION STYLE

APA

HUANG, X., ZHANG, X., SARDAR, S. M., & VEGA-MEJÍA, C. A. (2020). AN ENHANCED GENETIC ALGORITHM WITH AN INNOVATIVE ENCODING STRATEGY FOR FLEXIBLE JOB-SHOP SCHEDULING WITH OPERATION AND PROCESSING FLEXIBILITY. Journal of Industrial and Management Optimization, 16(6), 2943–2969. https://doi.org/10.3934/jimo.2019088

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free