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
相关论文
共 50 条
  • [31] An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
    Tao, Jiping
    Chao, Zhijun
    Xi, Yugeng
    Tao, Ye
    INFORMATION PROCESSING LETTERS, 2010, 110 (8-9) : 325 - 330
  • [32] Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time
    Luo, Taibo
    Xu, Yinfeng
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [33] ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES
    Zhang, An
    Jiang, Yiwei
    Tan, Zhiyi
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2011, 28 (02) : 163 - 182
  • [34] Optimal semi-online scheduling algorithms on a small number of machines
    Wu, Yong
    Tan, Zhiyi
    Yang, Qifan
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 504 - +
  • [35] Online and semi-online hierarchical scheduling for load balancing on uniform machines
    Hou, Li-ying
    Kang, Liying
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1092 - 1098
  • [36] Two semi-online scheduling problems on two uniform machines
    Ng, C. T.
    Tan, Zhiyi
    He, Yong
    Cheng, T. C. E.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 776 - 792
  • [37] Optimal Semi-online Scheduling Algorithm on three machines with non-simultaneous machine available times
    Huang, Yikun
    Wu, Yong
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON MODELLING AND SIMULATION (ICMS2009), VOL 6, 2009, : 288 - 293
  • [38] Semi-online scheduling of two job types on a set of multipurpose machines
    Karhi, Shlomo
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (09) : 1445 - 1455
  • [39] TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
    Li, Weidong
    Li, Jianping
    Zhang, Tongquan
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2012, 29 (05)
  • [40] Semi-online scheduling on two uniform machines with the known largest size
    Sheng-Yi Cai
    Qi-Fan Yang
    Journal of Combinatorial Optimization, 2011, 21 : 393 - 408
12345