Paper Title:
The Improved Genetic Algorithm for Multi-Objective Flexible Job Shop Scheduling Problem
  Abstract

To solve the multi-objective flexible job shop scheduling problem, an improved non-dominated sorting genetic algorithm is proposed. Multi-objective mathematical model is established, four objectives, makespan, maximal workload, total workload and total tardiness are considered together. In this paper a dual coding method is employed, and infeasible solutions were avoided by new crossover and mutation methods. Pareto optimal set was taken to deal with multi-objective optimization problem, in order to reduce computational complexity, the non-dominated sorting method was improved. The niche technology is adopted to increase the diversity of solutions, and a new self adaptive mutation rate computing method is designed. The proposed algorithm is tested on some instances, and the computation results demonstrate the superiority of the algorithm.

  Info
Periodical
Edited by
Honghua Tan
Pages
870-875
DOI
10.4028/www.scientific.net/AMM.66-68.870
Citation
J. J. Yang, L. Y. Ju, B. Y. Liu, "The Improved Genetic Algorithm for Multi-Objective Flexible Job Shop Scheduling Problem", Applied Mechanics and Materials, Vols. 66-68, pp. 870-875, 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: Lu Yan Ju, Jian Jun Yang, Bao Ye Liu
Engineering Optimization
Abstract:In order to optimize the multi-objective flexible job shop scheduling problem (FJSP) roundly, multi-objective mathematical model is...
2537
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
Authors: Zheng Ying Lin, Wei Zhang
Chapter 8: Machine Parts and Mechanisms of Technological Equipment, Control and Automation
Abstract:Due to several mutual conflicting optimized objectives in the hybrid flow shop scheduling problem, its optimized model, including three...
529