In this paper, the single machine scheduling problem with release dates and two hierarchical criteria is discussed. The first criterion is to minimize makespan, and the second criterion is to minimize stocking cost. W...In this paper, the single machine scheduling problem with release dates and two hierarchical criteria is discussed. The first criterion is to minimize makespan, and the second criterion is to minimize stocking cost. We show that this problem is strongly NP-hard. We also give an O（n^2） time algorithm for the special case that all stocking costs of jobs in unit time are 1.展开更多
针对标准逼近理想解排序法(technique for order preference by similarity to ideal solution,TOPSIS)在雷达干扰效果评估中存在受数据波动影响和对数据规律分析不充分的问题,提出了一种改进的TOPSIS法。该方法结合TOPSIS法和灰色关联...针对标准逼近理想解排序法(technique for order preference by similarity to ideal solution,TOPSIS)在雷达干扰效果评估中存在受数据波动影响和对数据规律分析不充分的问题,提出了一种改进的TOPSIS法。该方法结合TOPSIS法和灰色关联分析理论对原始数据进行分析,并组合2种方法的评估结果作为最终的评估结果,弥补了TOPSIS法在雷达干扰效果评估中的缺陷,仿真实验验证了该方法的有效性。展开更多
文摘In this paper, the single machine scheduling problem with release dates and two hierarchical criteria is discussed. The first criterion is to minimize makespan, and the second criterion is to minimize stocking cost. We show that this problem is strongly NP-hard. We also give an O（n^2） time algorithm for the special case that all stocking costs of jobs in unit time are 1.
文摘针对标准逼近理想解排序法(technique for order preference by similarity to ideal solution,TOPSIS)在雷达干扰效果评估中存在受数据波动影响和对数据规律分析不充分的问题,提出了一种改进的TOPSIS法。该方法结合TOPSIS法和灰色关联分析理论对原始数据进行分析,并组合2种方法的评估结果作为最终的评估结果,弥补了TOPSIS法在雷达干扰效果评估中的缺陷,仿真实验验证了该方法的有效性。
