| 求解目标是最小完成时间和的同类机调度的改进算法 |
| |
| 引用本文： | 李凯,杨善林,刘桂庆.求解目标是最小完成时间和的同类机调度的改进算法[J].系统仿真学报,2007,19(11):2618-2621. |
| |
| 作者姓名： | 李凯 杨善林 刘桂庆 |
| |
| 作者单位： | 1. 合肥工业大学管理学院,合肥,230009
2. 合肥工业大学管理学院,合肥,230009;合肥工业大学理学院,合肥,230009 |
| |
| 摘 要： | 研究了目标函数是完成时间和的同类机调度问题。同类机调度是一种重要的平行机调度问题,而最小完成时间和目标是最常见的规则目标一种,完成时间和的同类机调度问题在相关研究领域具有非常重要的地位。首先为此问题建立数学模型,然后提出一种改进的启发式算法,并通过实验验证了算法的性能。
|
| 关 键 词： | 调度 同类机 完成时间和 启发式算法 |
| 文章编号： | 1004-731X（2007）11-2618-04 |
| 收稿时间： | 2006-04-20 |
| 修稿时间： | 2006-04-202006-07-10 |
Improved Algorithm for Uniform Parallel-Machine Scheduling with Minimizing Total Completion Times |
| |
| LI Kai,YANG Shan-lin,LIU Gui-qing.Improved Algorithm for Uniform Parallel-Machine Scheduling with Minimizing Total Completion Times[J].Journal of System Simulation,2007,19(11):2618-2621. |
| |
| Authors: | LI Kai YANG Shan-lin LIU Gui-qing |
| |
| Institution: | 1 .School of Management, Hefei University of Technology, Hefei 230009, China; 2.School of Sciences, Hefei University of Technology, Hefei 230009, China |
| |
| Abstract: | Uniform parallel machine scheduling is an important class parallel machine scheduling problems. Total completion times is a familiar regular criteria. The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times, A mathematics model of for this problem was built, and an improved heuristic algorithm was proposed and the performance of the algorithm was validated by the way of experiment. |
| |
| Keywords: | scheduling uniform parallel-machine total completion times heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
