An Encoding Solution and Algorithms for Job-Shop
Scheduling Problem with Bottleneck

Huang　Qian; Huang　Hongzhong; Cai　Jianguo

Volume 12 Issue 2

Mar. 2010

Turn off MathJax

Article Contents

Journal of Southwest Jiaotong University > 1999 > 12(2): 185-189.

Huang　Qian, Huang　Hongzhong, Cai　Jianguo. An Encoding Solution and Algorithms for Job-ShopScheduling Problem with Bottleneck[J]. Journal of Southwest Jiaotong University, 1999, 12(2): 185-189.

Citation:

Huang　Qian, Huang　Hongzhong, Cai　Jianguo. An Encoding Solution and Algorithms for Job-Shop Scheduling Problem with Bottleneck[J]. Journal of Southwest Jiaotong University, 1999, 12(2): 185-189.

Huang　Qian, Huang　Hongzhong, Cai　Jianguo. An Encoding Solution and Algorithms for Job-ShopScheduling Problem with Bottleneck[J]. Journal of Southwest Jiaotong University, 1999, 12(2): 185-189.

Citation:

PDF( 0 KB)

An Encoding Solution and Algorithms for Job-Shop Scheduling Problem with Bottleneck

Publish Date: 25 Apr 1999

Abstract

Abstract

Genetic algorithm is currently one of the most effective methods for solving job-shop scheduling problem. Genetic encoding technique has a deep influence on genetic operation, especially on crossover operation. This paper presents an encoding solution for job-shop scheduling problem with bottlenecks, including algorithms for chromosome representation, chromosome construction and operation sequence generation. A practical encoding example is also presented.
- dispatching,
- chromosome,
- genetic algorithm,
- representation