| 工件工序可并行的作业车间调度模型与求解 |
| |
| 引用本文： | 刘晓平,徐本柱,彭军,沈冠町. 工件工序可并行的作业车间调度模型与求解[J]. 计算机辅助设计与图形学学报, 2012, 24(1): 120-127 |
| |
| 作者姓名： | 刘晓平 徐本柱 彭军 沈冠町 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院可视化与协同计算(VCC)研究室 合肥230009 |
| |
| 摘 要： | 针对传统作业车间调度模型没有考虑工件工序存在并行性的不足,提出一种以最小化完工时间为目标的工件工序可并行作业车间调度模型,且在模型中考虑了工序加工设备柔性；设计了基于遗传算法的调度算法,其中染色体编码采用分段编码方式,并提出一种适用于工件工序存在并行性的染色体解码方法.实验结果表明,文中算法能够有效地解决工件工序可并行的作业车间调度问题.
|
| 关 键 词： | 作业车间调度 工序并行 机器柔性 遗传算法 |
Model and Solution of Job-shop Scheduling for Parallel Processes |
| |
| Liu Xiaoping , Xu Benzhu , Peng Jun , Shen Guanting. Model and Solution of Job-shop Scheduling for Parallel Processes[J]. Journal of Computer-Aided Design & Computer Graphics, 2012, 24(1): 120-127 |
| |
| Authors: | Liu Xiaoping Xu Benzhu Peng Jun Shen Guanting |
| |
| Affiliation: | (VCC Division,School of Computer & Information,Hefei University of Technology,Hefei 230009) |
| |
| Abstract: | 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. |
| |
| Keywords: | job-shop scheduling process parallelism machine flexibility genetic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
