A new polynomial algorithm for a parallel identical scheduling problem-一种新的并行相同调度问题的多项式算法.pdfVIP

Journal 2007 DOI10 ofControlTheory 5(4)345-350 andApplications Anew fora polynomialalgorithmparallel identical schedulingproblem 3 LI LI C．YEN Yumei 2。Vincent l，Hongxing School (1 ofInformationEngineering．ReUmgTechnology 2SchoolofMathematical Normal 100875，China； Sciences．BeijingUniversity．Beijing ofMgnagementScience 3Department datcs successorsthedefined Abstract：A orderisdefinedbasedontherelease precedence ofjobs’direct Using and whichaimstosolvethe order Sort,anew is precedence Heap polynomialalgorithmprovided parallelscheduling bemore showntocompactandeasiertoimplement． problemPIP#=1，rj，outtreeI∑cJ．Thenewalgorithmis Keywords：Schedulingproblem；Precedenceorder；Heapsort；Algorithm 1 Introduction relaxedall consid— one，they relations，i．e．，mey precedence ered thesecond one，theyreplaced Parallelidentical with PI,s=l，oI∑0；in schedulingproblemsobjective all of thenumberofmachinesm