Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

被引：0
作者：
Ming Liu
Chengbin Chu
Yinfeng Xu
Feifeng Zheng
机构：
[1] Xi’an Jiaotong University,School of Management
[2] Ecole Centrale Paris,Laboratoire Génie Industriel
来源：
Journal of Combinatorial Optimization | 2011年 / 21卷
关键词：
Online scheduling; Makespan; Competitive analysis; Grade of service; Bounded processing times; Total processing time;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study the problem of semi-online scheduling on 2 machines under a grade of service (GoS). GoS means that some jobs have to be processed by some machines to be guaranteed a high quality. The problem is online in the sense that jobs are presented one by one, and each job shall be assigned to a time slot on its arrival. Assume that the processing time pi of every job Ji is bounded by an interval [a,αa], where a>0 and α>1 are two constant numbers. By knowing the bound of jobs’ processing times, we denote it by semi-online problem. We deal with two semi-online problems.
引用
收藏
页码：138 / 149
页数：11
相关论文
共 12 条
  • [1] He Y(1999)Semi on-line scheduling on two identical machines Computing 62 179-187
  • [2] Zhang G(2004)Parallel machines scheduling under a grade of service provision Comput Oper Res 31 2055-2061
  • [3] Hwang H(2008)Online scheduling on parallel machines with two GoS levels J Comb Optim 16 28-38
  • [4] Chang S(2006)Optimal online algorithms for scheduling on two identical machines under a grade of service J Zhejiang Univ Sci A 7 309-314
  • [5] Lee K(2006)Online and semi-online scheduling of two machines under a grade of service provision Oper Res Lett 34 692-696
  • [6] Jiang Y(undefined)undefined undefined undefined undefined-undefined
  • [7] Jiang Y(undefined)undefined undefined undefined undefined-undefined
  • [8] He Y(undefined)undefined undefined undefined undefined-undefined
  • [9] Tang C(undefined)undefined undefined undefined undefined-undefined
  • [10] Park J(undefined)undefined undefined undefined undefined-undefined
12