On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints

被引：6
|
作者：
Zhang, An [1 ]
机构：
[1] Hangzhou Dianzi Univ, Dept Math, Hangzhou 310018, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2015年 / 43卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Online scheduling; Grade of Service eligibility; Competitive ratio; Linear programming; SERVICE PROVISION; HIERARCHICAL MACHINES; PARALLEL MACHINES; GRADE; COMPETITIVENESS;
D O I：
10.1016/j.orl.2015.07.008
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the online scheduling problem on in identical machines subject to the Grade of Service (GoS) eligibility constraints. The goal is to minimize the makespan. For fractional jobs that can be arbitrarily split between machines and can be processed in parallel, we provide an optimal online algorithm based on the solution of linear programming. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：522 / 525
页数：4
相关论文
共 50 条
  • [1] Semi-online scheduling with GoS eligibility constraints
    Lee, Kangbok
    Hwang, Hark-Chin
    Lim, Kyungkuk
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 153 : 204 - 214
  • [2] An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints
    Xu J.
    Liu Z.-H.
    Journal of the Operations Research Society of China, 2016, 4 (03) : 371 - 377
  • [3] LP-based online scheduling: From single to parallel machines
    Correa, JR
    Wagner, MR
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 196 - 209
  • [4] LP-based online scheduling: from single to parallel machines
    Correa, Jose R.
    Wagner, Michael R.
    MATHEMATICAL PROGRAMMING, 2009, 119 (01) : 109 - 136
  • [5] LP-based online scheduling: from single to parallel machines
    José R. Correa
    Michael R. Wagner
    Mathematical Programming, 2009, 119 : 109 - 136
  • [6] AN LP-BASED ALGORITHM TO TEST COPOSITIVITY
    Tanaka, Akihiro
    Yoshise, Akiko
    PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (01): : 101 - 120
  • [7] A robust LP-based approach for a dynamic surgical case scheduling problem with sterilisation constraints
    Al Hasan, H.
    Gueret, C.
    Lemoine, D.
    Rivreau, D.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (16) : 5925 - 5944
  • [8] Improved bounds for online scheduling with eligibility constraints
    Lim, Kyungkuk
    Lee, Kangbok
    Chang, Soo Y.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5211 - 5224
  • [9] LP-based heuristics for scheduling chemical batch processes
    Blömer, F
    Günther, HO
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (05) : 1029 - 1051
  • [10] An LP-Based Algorithm for Scheduling Preemptive and/or Non-Preemptive Real-Time Tasks
    Hashimoto, Hideki
    Yagiura, Mutsunori
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2010, 4 (03): : 578 - 587
12345