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 条
  • [1] Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
    Liu, Ming
    Chu, Chengbin
    Xu, Yinfeng
    Zheng, Feifeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (01) : 138 - 149
  • [2] Online and semi-online scheduling of two machines under a grade of service provision
    Park, Jongho
    Chang, Soo Y.
    Lee, Kangbok
    OPERATIONS RESEARCH LETTERS, 2006, 34 (06) : 692 - 696
  • [3] Semi-online scheduling problems on two uniform machines under a grade of service provision
    Lu, Xinrong
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2013, 489 : 58 - 66
  • [4] Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
    Wu, Yong
    Ji, Min
    Yang, Qifan
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 135 (01) : 367 - 371
  • [5] Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision
    Wu, Yong
    Yang, Qifan
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 261 - +
  • [6] Semi-online Machine Covering under a Grade of Service Provision
    Wu, Yong
    Ji, Min
    Yang, Qifan
    ADVANCES IN ENGINEERING DESIGN AND OPTIMIZATION II, PTS 1 AND 2, 2012, 102-102 : 484 - +
  • [7] Semi-online Machine Covering Problem on Three Hierarchical Machines with Bounded Processing Times
    Xiao, Man
    Du, Yu-Fei
    Li, Wei-Dong
    Yang, Jin-Hua
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024, 12 (04) : 1126 - 1138
  • [8] Online scheduling of two identical machines under a grade of service provision
    Cai, Shuang
    Liu, Ao
    Liu, Ke
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 2718 - 2722
  • [9] Semi-online scheduling with bounded job sizes on two uniform machines
    Cao, Qian
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 1 - 17
  • [10] Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
    He, Y
    Dósa, G
    DISCRETE APPLIED MATHEMATICS, 2005, 150 (1-3) : 140 - 159
12345