%0 Journal Article
%T Heuristics for Uniform Parallel Machine Scheduling with Release Dates<br>含作业到达时间的同类机调度问题启发式算法
%A LI Kai
%A JIN Peng
%A <br>李 凯
%A 靳 鹏
%J 系统工程理论与实践
%D 2007
%I 
%X This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize total completion times.This problem is proved to an NP-hard problem.Uniform parallel machine scheduling is an important class of parallel machine scheduling problems.The objective of minimizing total completion times is a familiar regular criterion.We build a mathematics model for this problem,and then propose 6 heuristic algorithms by the way of extending the research results of the corresponding problems in the single machine or identical parallel machine cases.An example and the compute results are given and the performance of the algorithms by experiment is also analyzed.
%K uniform parallel-machine scheduling
%K total completion times
%K release date
%K heuristic algorithm<br>同类机调度
%K 完成时间和
%K 到达时间
%K 启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=4AB5C9DFA276C7D2ECDAD4EF3176C958&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=03F1579EF92A5A32&eid=480C51B1F0CE0AB6&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=15