The Optimization of Flexible Job Shop Scheduling Problem Based on Improved Dual Coding Non-Dominated Sorting Genetic Algorithm

Abstract:

Article Preview

In order to optimize the multi-objective flexible job shop scheduling problem (FJSP) roundly, multi-objective mathematical model is established, including makespan, maximal workload, total workload and total tardiness. In this paper a dual coding method which takes operation arrangement and machine selection into account is employed, and designed new crossover and mutation methods, the infeasible solutions are avoided. In order to deal with the multi-objective optimization problem, a new non-dominated sorting method is introduced, which can get the Pareto optimal solutions quickly and correctly by dividing the whole population into three parts. Example shows that the algorithm is efficient.

Info:

Periodical:

Advanced Materials Research (Volumes 291-294)

Edited by:

Yungang Li, Pengcheng Wang, Liqun Ai, Xiaoming Sang and Jinglong Bu

Pages:

2537-2540

DOI:

10.4028/www.scientific.net/AMR.291-294.2537

Citation:

L. Y. Ju et al., "The Optimization of Flexible Job Shop Scheduling Problem Based on Improved Dual Coding Non-Dominated Sorting Genetic Algorithm", Advanced Materials Research, Vols. 291-294, pp. 2537-2540, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.