求解目标是最小完成时间和的同类机调度的改进算法  

Improved Algorithm for Uniform Parallel-Machine Scheduling with Minimizing Total Completion Times

作　　者：李凯[1] 杨善林[1] 刘桂庆[1] 

机构地区：[1]合肥工业大学管理学院,合肥230009

出　　处：《系统仿真学报》2007年第11期2618-2621,共4页Journal of System Simulation

基　　金：国家自然科学基金重点项目(70631003)

摘　　要：研究了目标函数是完成时间和的同类机调度问题。同类机调度是一种重要的平行机调度问题,而最小完成时间和目标是最常见的规则目标一种,完成时间和的同类机调度问题在相关研究领域具有非常重要的地位。首先为此问题建立数学模型,然后提出一种改进的启发式算法,并通过实验验证了算法的性能。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.

关 键 词：调度 同类机 完成时间和 启发式算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] O223[自动化与计算机技术—计算机科学与技术]