论文部分内容阅读
研究了一类平行机调度问题,其中假定作业加工时间是资源消耗量的线性减函数,调度的目标是在限定最大完工时间时最小化资源消耗总量.分析了对应单机问题的最优算法和下界构造方法,进而提出了两个优化策略用于构造模拟退火算法和禁忌搜索算法.考虑了多种最大完工时间限制情形,构造了大量随机实验数据,对算法解的精确度及计算效率进行了测试.实验表明所构造的模拟退火算法能够在合理的时间内提供高质量的满意解.
A class of parallel machine scheduling problem is studied, in which job processing time is assumed to be a linear decreasing function of resource consumption, and the goal of scheduling is to minimize the total resource consumption when the maximum completion time is limited.An optimal algorithm and Then, two optimization strategies are proposed to construct the simulated annealing algorithm and the tabu search algorithm. Considering a variety of maximum completion time constraints, a large number of random experimental data are constructed, and the accuracy and computational efficiency of the algorithm are studied The experiments show that the constructed simulated annealing algorithm can provide high quality satisfactory solutions in a reasonable time.