|
|||||
|
|
Online scheduling of two type parallel jobs on identical machines |
|
| Authors: | GUO Shou-wei KANG Li-ying |
| Institution: | Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China |
| Abstract: | 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”. |
| Keywords: | scheduling parallel jobs preemption online algorithm competitive analysis |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |
| 点击此处可从《上海大学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《上海大学学报(英文版)》下载免费的PDF全文 | |