Paper Title:
Improved Genetic Algorithm Based on Operation Order Matrix Encoding for Job Shop Scheduling Problem
  Abstract

This paper presents an improved genetic algorithm for the job shop scheduling problem. We designed a new encoding method based on operation order matrix, a matrix correspond to a chromosome, the value of elements is not repetitive, that means a processing order number in all operations of all jobs. Aiming at the features of the matrix encoding, we designed the crossover and mutation methods based on jobs, and the infeasible solutions are avoided. Through adjusting the computing method of fitness value, the improved genetic algorithm takes on some self adapting capability. The proposed approach is tested on some standard instances and compared with two other approaches. The computation results validate the algorithm is efficient.

  Info
Periodical
Advanced Materials Research (Volumes 189-193)
Edited by
Zhengyi Jiang, Shanqing Li, Jianmin Zeng, Xiaoping Liao and Daoguo Yang
Pages
4212-4215
DOI
10.4028/www.scientific.net/AMR.189-193.4212
Citation
H. Zhan, J. J. Yang, L. Y. Ju, "Improved Genetic Algorithm Based on Operation Order Matrix Encoding for Job Shop Scheduling Problem", Advanced Materials Research, Vols. 189-193, pp. 4212-4215, 2011
Online since
February 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: Si Lian Xie, Tie Bin Wu, Shui Ping Wu, Yun Lian Liu
Chapter 18: Computer Applications in Industry and Engineering
Abstract:Evolutionary algorithms are amongst the best known methods of solving difficult constrained optimization problems, for which traditional...
2846
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502
Authors: Lu Cheng, Guang Rui Liao, Zhen Yuan Liu
Chapter 9: Engineering Management
Abstract:In this paper, we address the project scheduling problem with the aim of making the best use of people's talents while minimizing project...
1268
Authors: Guo Hua Zhou
Chapter 4: Communication, Networks, Applied Information Technologies, Algorithms and Data Processing
Abstract:job shop scheduling is one of the most difficult NP-hard combinatorial optimize problems, in order to solve this problem, an improved Genetic...
417