The paper discusses a class of generalized multiprocessor scheduling problems which is to arrange some independent jobs on almost identical processors. Different from the classical multiprocessor scheduling, each job ...
详细信息
The paper discusses a class of generalized multiprocessor scheduling problems which is to arrange some independent jobs on almost identical processors. Different from the classical multiprocessor scheduling, each job may only be processed by some processors, not all. In this paper, we first prove that the problems of minimization makespan and minimization total weighted completion time can be solved by the polynomial algorithms if all processing time are unit time. Then for arbitrary processing time, we try to analyze the worst performance of list schedule (LS) method and longest processing time(LPT) method when there are only two machines involved. We show that the bounds for LS and LPT are exactly two.
本文介绍了 Va R的理论及其 4种计算方法 ,即 Risk Metrics、Historical Simulation、HeavyTail和 The Bootstrap方法。结合外汇市场上加元、日元、英镑、法郎和马克对美元的汇率用不同的方法计算了在不同概率下外汇市场的 Va R值。我...
详细信息
本文介绍了 Va R的理论及其 4种计算方法 ,即 Risk Metrics、Historical Simulation、HeavyTail和 The Bootstrap方法。结合外汇市场上加元、日元、英镑、法郎和马克对美元的汇率用不同的方法计算了在不同概率下外汇市场的 Va R值。我们得到以下几个结果 :在相同概率下 ,加元的 Va R值最小 ,日元的 Va R值最大 ,英镑、法郎和马克的 Va R值相差不大 ;外汇市场其收益率的分布具有厚尾性。
暂无评论