Model and solution of job-shop scheduling for parallel processes

被引：0

作者：

Liu, Xiaoping ^{[1
]}

Xu, Benzhu ^{[1
]}

Peng, Jun ^{[1
]}

Shen, Guanting ^{[1
]}

机构：

[1] VCC Division, School of Computer and Information, Hefei University of Technology, Hefei 230009, China

来源：

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2012年 / 24卷 / 01期

关键词：

Job shop scheduling - Scheduling algorithms;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Focusing on the merit of process parallelism existing in the actual production, a job-shop scheduling model for parallel processes is proposed in this paper which aims to minimize makespan and considers machine flexibility among production processes. This model is implemented with a genetic algorithm-based scheduling algorithm in which a blocking encode method is used and a corresponding decode measure is put forward, which is suitable for parallel processes. The experiment result shows that the scheduling algorithm can solve the job-shop scheduling problem with parallel processes effectively.

引用

页码：120 / 127