Online scheduling of two type parallel jobs on identical machines  

作　　者：郭首玮 康丽英 

机构地区：[1]Department of Mathematics,College of Sciences,Shanghai University

出　　处：《Journal of Shanghai University(English Edition)》2010年第6期396-399,共4页上海大学学报（英文版）

基　　金：Project supported by the National Natural Science Foundation of China (Grant No.10971131);the Shanghai Leading AcademicDiscipline Project (Grant No.S30104);the Innovation Foundation of Shanghai University (Grant No.SHUCX091077)

摘　　要：In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using ＂temporary schedule＂.In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using ＂temporary schedule＂.

关 键 词：SCHEDULING parallel jobs PREEMPTION online algorithm competitive analysis 

分 类 号：O223[理学—运筹学与控制论]