节点文献
求解目标是最小完成时间和的同类机调度的改进算法
Improved Algorithm for Uniform Parallel-Machine Scheduling with Minimizing Total Completion Times
【摘要】 研究了目标函数是完成时间和的同类机调度问题。同类机调度是一种重要的平行机调度问题,而最小完成时间和目标是最常见的规则目标一种,完成时间和的同类机调度问题在相关研究领域具有非常重要的地位。首先为此问题建立数学模型,然后提出一种改进的启发式算法,并通过实验验证了算法的性能。
【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.
【关键词】 调度;
同类机;
完成时间和;
启发式算法;
【Key words】 scheduling; uniform parallel-machine; total completion times; heuristic algorithm;
【Key words】 scheduling; uniform parallel-machine; total completion times; heuristic algorithm;
【基金】 国家自然科学基金重点项目(70631003)
- 【文献出处】 系统仿真学报 ,Journal of System Simulation , 编辑部邮箱 ,2007年11期
- 【分类号】TP301
- 【被引频次】5
- 【下载频次】206