带有链优先约束两类排序问题.pdfVIP

曲阜师范大学硕士学位论文 _ specialcaseswhichcanbesolvedinpolynomialtime. (3)Precedenceconstrainsareasfollows:Therearemchainswith:。:jobs ineachchain,where1im,andeachchainsatisfiesagreeble.wediscuss theoptimalalgorithmforthiscasewhereeachbatchcontainsatmosttwojobs, i.e.B=2.WeshowthatthisproblemcanbesolvedinO(n)time.Infact, wecanreducethisproblemtoanon-bipartieweightedmatchingproblem. Inthethirdchapter,weconsidertheproblemofschedulingjobswithchain precedenceconstraintsonidenticalparallelmachines.Theobjectivefunction istominimizethemakesp