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 条
  • [11] The economic lot scheduling problem - survey and LP-based method
    Carstensen, P
    OR SPEKTRUM, 1999, 21 (04) : 429 - 460
  • [12] A new LP-based lower bound for the cumulative scheduling problem
    Carlier, J
    Néron, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (02) : 363 - 382
  • [13] An experimental study of LP-based approximation algorithms for scheduling problems
    Savelsbergh, MWP
    Urna, RN
    Wein, J
    INFORMS JOURNAL ON COMPUTING, 2005, 17 (01) : 123 - 136
  • [14] Approximation in stochastic scheduling:: The power of LP-based priority policies
    Möhring, RH
    Schulz, AS
    Uetz, M
    JOURNAL OF THE ACM, 1999, 46 (06) : 924 - 942
  • [15] LP-based working subsets for personnel scheduling: evaluation and augmentation
    Brusco, Michael J.
    Johns, Tony R.
    Venkataraman, Ray R.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2018, 12 (02) : 175 - 198
  • [16] Online scheduling on two uniform machines subject to eligibility constraints
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedoa, Michael L.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3975 - 3981
  • [17] Online scheduling with equal processing times and machine eligibility constraints
    Xu, Jia
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2015, 572 : 58 - 65
  • [18] Heuristic decomposition and LP-based scheduling in make-and-pack production
    Baumann, Philipp
    Trautmann, Norbert
    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 362 - 366
  • [19] A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints
    Hwang, HC
    Chang, SY
    Hong, YS
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2004, 21 (01) : 117 - 125
  • [20] A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
    Bamas, Etienne
    Drygala, Marina
    Svensson, Ola
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2022, 2022, 13265 : 57 - 69
12345