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 条
  • [31] Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs
    Ravi, R.
    Singh, Mohit
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 169 - 180
  • [32] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Taibo Luo
    Yinfeng Xu
    Optimization Letters, 2016, 10 : 207 - 213
  • [33] On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems
    Uma, RN
    Wein, J
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 394 - 408
  • [34] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Luo, Taibo
    Xu, Yinfeng
    OPTIMIZATION LETTERS, 2016, 10 (01) : 207 - 213
  • [35] Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances
    Blum, Christian
    Pereira, Jordi
    GECCO'16: PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2016, : 285 - 292
  • [36] An LP-based k-means algorithm for balancing weighted point sets
    Borgwardt, S.
    Brieden, A.
    Gritzmann, P.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 263 (02) : 349 - 355
  • [37] A Preciser LP-Based Algorithm for Critical Link Set Problem in Complex Networks
    Zhou, Xing
    Peng, Wei
    MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 263 - 275
  • [38] ANALYTICAL ALGORITHM FOR CONSTRAINT RELAXATION IN LP-BASED OPTIMAL POWER-FLOW
    ZHANG, S
    IRVING, MR
    IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION, 1993, 140 (04) : 326 - 330
  • [39] An LP-based heuristic algorithm for the node capacitated in-tree packing problem
    Tanaka, Yuma
    Imahori, Shinji
    Sasaki, Mihiro
    Yagiura, Mutsunori
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 637 - 646
  • [40] The economic lot scheduling problem - Survey and LP-based method [Das Economic Lot Scheduling Problem - Überblick und LP-basiertes Verfahren]
    Carstensen P.
    OR-Spektrum, 1999, 21 (4) : 429 - 460
12345