• 论文 •    

基于工件聚类的并行机调度算法及其应用

郝井华, 刘民, 吴澄, 张瑞   

  1. 清华大学 自动化系,北京100084
  • 出版日期:2006-12-15 发布日期:2006-12-25

Job-clustering-based scheduling algorithm for parallel machine and its application

HAO Jing-hua, LIU Min, WU Cheng, ZHANG Rui   

  1. Dep. of Automation, Tsinghua Univ., Beijing100084, China
  • Online:2006-12-15 Published:2006-12-25

摘要: 针对纺织生产广泛存在的带工件释放时间、以最小化总拖期工件数和总拖期时间为目标的大规模并行机调度问题,提出一种基于工件聚类的遗传算法。该算法将求解过程分为工件聚类和工件排序两个阶段。在工件聚类阶段,基于影响并行机调度性能的重要调度特征量,采用改进的模糊C-均值聚类方法将所有待上机工件分为多个聚类;在工件排序阶段,采用基于规则编码的遗传算法,优化各聚类内工件的加工顺序。数值计算结果及实际应用效果表明,所提出的算法适用于求解带工件释放时间的大规模并行机调度问题。

关键词: 并行机, 调度, 聚类, 遗传算法, 纺织

Abstract: To solve the large-scale identical parallel machine scheduling problem with release dates, the objectives of minimizing the total tardy number of jobs, and the total tardiness, a job-clustering-based genetic algorithm was presented. In this algorithm, the whole scheduling process was divided into two phases: the job-clustering phase and the job-sequencing phase. In the job-clustering phase, based on important scheduling characteristics affecting parallel machine scheduling performance, the clustering vector set was formed and all unscheduled jobs were clustered to different job sets by a modified Fuzzy C-Means (FCM) algorithm. In the job-sequencing phase, a rule coding based genetic algorithm was adopted to optimize the job sequence in each cluster. Results of numerical computations on different parallel machine scheduling problems and practical applications showed that the proposed algorithm was suitable for larger-scale parallel machine scheduling problems with release dates.

Key words: parallel machine, scheduling, clustering, genetic algorithm, textile

中图分类号: