摘要：This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.

摘要：研究了一类资源受限的平行机调度问题,其中假定作业的处理时间是其消耗资源量的凸减函数,调度的目标是在限定资源总量的情况下最小化makespan(最大完工时间)。给出了此类NP-hard问题的形式化描述。定义了关键机器与非关键机器,给出了非最优解必定存在非关键机器的论断。尽快缩短非关键机器与关键机器之间工作量的差距能够有效逼近最优解,从而构造了快速的模拟退火算法。设计了一个下界用于衡量解的精度,并用于构造模拟退火算法迭代结束条件。算法性能通过20000组随机数值算例进行了测试,实验结果表明所构造的模拟退火算法能够在0.1秒之内有效求解1000个作业的问题并将相对误差控制在0.01%以内。该算法体现出很高的精度和计算效率。

摘要：论文研究卸载集装箱堆场空间分配与车辆调度的集成作业问题.在该问题中,卸载集装箱动态到达,车辆循环使用,需要同时决策集装箱堆放位置及车辆的分配和路线.对此问题建立整数规划数学模型,考虑车辆调度约束以及堆场吊机操作等实际约束,目标函数为最小化makespan.根据问题的特点设计两阶段禁忌搜索算法来求解此问题.在实验中,通过将禁忌搜索算法的结果同标准优化软件CPLEX所求得的最优解或下界比较,算法求得了其中7组算例的最优解且剩余算例平均偏差小于5%,说明所设计的算法可以有效地解决该集成问题.

摘要：In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.

摘要：资源预留可以保证任务在开始执行时获得资源,而这在网格这样资源动态性很强的环境中是很可贵的,因而资源预留是网格任务调度中一种普遍采用的策略。当前资源预留的研究主要集中在计算资源预留的情况,文中提出了一个网格环境中资源预留的统一策略,该策略对其它资源的预留和计算资源的预留一起加以考虑,经过模拟验证,该策略能够很好地和我们先前设计的一种基于资源预留的任务映射算法结合起来,适用于网格的动态、异构性环境。

摘要：在分析网格计算中经典的Min-Min和Max-Min任务调度算法的基础上,针对Min-Min算法存在的负载不均衡的缺陷,本文提出了一种负载均衡的网格任务调度算法LBGTSA,以有效地均衡负载;给出了LBGTSA算法的设计原理和实现过程,而且采用GridSim模拟工具对LBGTSA和Min-Min算法进行了模拟实验,实验结果分析表明,LBGTSA比Min-Min能获得更小的makespan,而且能有效地均衡负载。

摘要：研究了MapReduce系统中极小化最大完工时间的同类机排序问题.每个工件包含两类任务集:Map任务集和Reduce任务集.工件的Reduce任务必须在该工件的所有Map任务完成后才能开始加工.Map任务是可分的,即可以被任意分割并在多台机器上同时加工,而Reduce任务是不可分的.针对m台同类机离线模型,分别考虑了Reduce任务可中断和不可中断两种情形.对于可中断情形,设计了一个近似比为2-■的近似算法,其中g_1≥1,s_i为机器σ_i的加工速度且s_1≥s_2≥…≥s_m;对于不可中断情形,则给出了一个近似比为2+3^(1/2)/3的近似算法.上述结果是对已有文献的改进.

摘要：Buyya提出的费用-时间优化算法运用经济规律把网格用户的任务映射到网格资源,但没有考虑任务间的优先关系。本文综合考虑时间、费用以及任务间的优先关系等诸多QoS需求,提出了基于有向无环图的优化调度算法。通过仿真实例,论证了该算法的优越性。