机器有两种不同速度的平行工件在线排序-运筹学与控制论专业论文.docxVIP

制下，给出了一个竞争比为2+而m丽s-s-2 制下，给出了一个竞争比为 2+而m丽s-s-2 1887 口= 2+粼 8’sm 2一篙 sm st=型噜署匦)的算法．其中P2善叻功，肼一2m。axp．i (4)对于排序模型Q2mlrj。o，mj，on—line一礼铡I‰。，在P≥m(s+1)m—ax mjpj 限制下，使用等效化(Virtualization)这一手段，给出了一个竞争比为 P=2一而1 的算法·其中JP2善％巧· 关键词；平行机；平行工件；排序；竞争比；快机器；慢机器 2 AbstractIn Abstract In this paper，we deal with some scheduling problems of parallel jobs．There are 2m uniform machines with m machines of speed s(s11 and m machines of speed 1．Every parallel job Jj may require”b(m≥0≥1)machines simultaneously,and every job is only able to choose machines with the same speed．We assul]le D=0 for all jobs，but their processing time is unknown until the job has finished．This tipy of on-line models is Called nonclairvoyant，denoted by ncv in short．The objective is makespan minimization(Ck∞)． Using the 3-field notation，our problem is denoted as Q2mlri=0，％，on—line—n倒Ic‰∞． We present algorithms for the scheduling problem and adopt the standard performance measure compititive ratio to analyze it．We alse provide lower bounds by the specific instances．At the same time，we consider special cases of the problem，and give better compititive algorithms． The main results of this paper are as follows． (1)For the scheduling model Q2mID=0，％，on—line—n删lGm，we give the lower bound 胪2一南· (2)For the scheduling model Q2m[rJ=o，mj，on—line一扎∞I％∞，we give an algorithm with competitive ratio p={s【2霉1二蚤 ～e 矿 I』 翥 赢 3+丽m+蒜‰ f碌磊；i． j 3 (3)For (3)For the scheduling model Q2m}ri=0，％，on—line一删I‰，when P≥ m0+1)肼M，we give an algorithm with competitive ratio l 2+丽m耳s可-s丽-2 1≤s≤s7 P2{ 2+器等暴 s，≤s≤m (s’=呼，P 【2一等 s≥m 2善他功，and‰=警功) (4)EDr‘he sclleduling model Q2m[rj 2 o，mj，on—line—ncv[Cma．z withP≥m(s+1)1警％巧 and using virtualization，we give an algorithm with competitive ratio p=。一而‰ (P=∑叻黪) Key Words：parallel machine；parallel job；on-line scheduling；competitive ratio fast machine；slow machine 4 第一章绪论§1．1 第一章绪论 §1．1 排序的介绍 排序，是在一定条件下分配时间资源去完成一些任务，使得某一个或某一 些目标达到最优。它是一类重要的组合最优化问题，是运筹学研究的一个非常 活跃的分支。排序问题产生的背景是机器制造。二战之后，随着大型制造业的兴 起，人们逐渐意识到排序问题研