| 具有周期维护的最小化工件完成时刻之和的平行机调度问题 |
| |
| 引用本文： | 曹雁卿.具有周期维护的最小化工件完成时刻之和的平行机调度问题[J].江西科学,2012,30(4):434-437. |
| |
| 作者姓名： | 曹雁卿 |
| |
| 作者单位： | 东华理工大学理学院,江西南昌,330013 |
| |
| 摘 要： | 考虑具有周期维护的m台平行机调度问题,一组给定的工件在这些机器上加工,目标是给出工件完成时刻和最小的调度方案。基于经典的SPT(最短加工时间优先)算法,提出了名为MSPT的启发式算法,并证明了该算法优于SPT算法。
|
| 关 键 词： | 平行机调度 周期维护 完成时刻之和 启发式算法 |
Parallel Machine Scheduling Problem with Periodic Maintenance to Minimize Sum of Job Completion time |
| |
| CAO Yan-qing.Parallel Machine Scheduling Problem with Periodic Maintenance to Minimize Sum of Job Completion time[J].Jiangxi Science,2012,30(4):434-437. |
| |
| Authors: | CAO Yan-qing |
| |
| Institution: | CAO Yan-qing(School of Science,East China Institute of Technology,Jiangxi Nanchang 330013 PRC) |
| |
| Abstract: | Consider a parallel machine scheduling problem with m machines and periodic maintenance,where a given set of jobs have to be processed,the objective is to find a schedule such that the sum of the job completion times is minimum.A heuristic algorithm named MSPT is proposed base on the classical SPT（the shortest processing time first） algorithm.It is showed that the proposed algorithm is better than the SPT algorithm. |
| |
| Keywords: | Parallel machine scheduing Periodic maintenance Sum of completion times Heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
