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

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)
Chapter
Engineering Optimization
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, J. J. Yang, B. Y. Liu, "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
$32.00
Share

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

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

Authors: Jian Jun Yang, Lu Yan Ju, Bao Ye Liu
Abstract:To solve the multi-objective flexible job shop scheduling problem, an improved non-dominated sorting genetic algorithm is proposed....
870
Authors: Shu Zhi Nie, Yan Hua Zhong
Chapter 1: Mechanic Manufacturing System and Automation
Abstract:In this paper, According to the collaborative manufacturing resources optimization deployment problems, designed subsection crossover and...
289
Authors: Yan Li Yang, Wei Wei Ke
Chapter 9: Others
Abstract:An improved genetic algorithm is proposed by introducing selection operation and crossover operation, which overcomes the limitations of the...
588
Authors: Long Xu, Wen Bin Hu
Chapter 10: Computer Application Technology
Abstract:Job Shop Scheduling Problem (JSSP) is a famous NP-hard problem in scheduling field. The concentration of JSSP is to find a feasible...
1251
Authors: Jian Jun Yang, Hong Zhan, Ji Wen Tan, Yu Cheng Ding
Chapter 5: Frontiers of Mechanical Engineering
Abstract:In laser processing, optimizing the shortest process time is not equal to optimizing the shortest path, and the spare travel time decided the...
1504