工件可选择的平行机在线排序.pdfVIP

Abstract Parallelmachine isoneofthe modelsused scheduling scheduling being this we an consideron-line machine inwhichcarl paper parallel schedulingproblem jobs be cail as： chosen．Ourmodelbe represented Pm]on—line，巧，DI∑厶， D is inwhichisthetimelimitof the profitbyprocessingjob goal machines，|i J{．The istoselectSOastomaximizethetotal ofall the jobs profit processedjobsduringperiod thatmachinescanused． be in anew form Themodelweconsiderthis is isanon-line of paper type．It scheduling the Preblem．Wehavenotseen Oilsuchmodel Knapsack anystudy linemeansthat arriveover all jobs time，andjobcharacteristics(includingarrivingtimes) areunknownbeforetheirarrivaltimes．Jobscannotbescheduledbeforearrived． they Parallelmachinereferstothemachineconditioninthismodelwhichmeansthatthereare mmachinesofthesame andthesame the ofourmodel type workingspeed．Sinceobjective ist。be worst_caserati。isdeftnited instance maximized，the by any A， p=瓣{篇)，for A． 盯isa obtainedtheon—line isanoff-line of