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.
暂无评论