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 条
  • [41] Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines
    Dai, Bingfei
    Li, Jianping
    Li, Weidong
    PROCEEDINGS OF 2018 THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (CSAI 2018) / 2018 THE 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY (ICIMT 2018), 2018, : 609 - 614
  • [42] Semi-online scheduling with combined information on two identical machines in parallel
    Qian Cao
    Guohua Wan
    Journal of Combinatorial Optimization, 2016, 31 : 686 - 695
  • [43] Semi-online scheduling on two uniform machines with the known largest size
    Cai, Sheng-Yi
    Yang, Qi-Fan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (04) : 393 - 408
  • [44] Optimal semi-online algorithm for scheduling with rejection on two uniform machines
    Xiao Min
    Jing Liu
    Yuqing Wang
    Journal of Combinatorial Optimization, 2011, 22 : 674 - 683
  • [45] Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Wang, Lu
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 346 - +
  • [46] OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Wang, Lu
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (02) : 219 - 226
  • [47] Optimal semi-online algorithm for scheduling with rejection on two uniform machines
    Min, Xiao
    Liu, Jing
    Wang, Yuqing
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (04) : 674 - 683
  • [48] Semi-online scheduling on two uniform parallel machines with initial lookahead
    Zheng, Feifeng
    Chen, Yuhong
    Liu, Ming
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (03) : 2621 - 2630
  • [49] Preemptive semi-online scheduling on parallel machines with inexact partial information
    He, Y
    Jiang, YW
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 422 - 432
  • [50] Semi-online scheduling with combined information on two identical machines in parallel
    Cao, Qian
    Wan, Guohua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 686 - 695
12345