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 条
  • [21] An LP-based algorithm for the data association problem in multitarget tracking
    Storms, PPA
    Spieksma, FCR
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (07) : 1067 - 1085
  • [22] An lp-based Reconstruction Algorithm for Compressed Sensing Radar Imaging
    Zheng, Le
    Maleki, Arian
    Liu, Quanhua
    Wang, Xiaodong
    Yang, Xiaopeng
    2016 IEEE RADAR CONFERENCE (RADARCONF), 2016, : 724 - 728
  • [23] Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
    Gondek, Verena
    OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 485 - 490
  • [24] An LP-based tabu search for batch scheduling in a cutting process with finite buffers
    Arbib, Claudio
    Marinelli, Fabrizio
    Pezzella, Ferdinando
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 136 (02) : 287 - 296
  • [25] An LP-based approximation algorithm for the generalized traveling salesman path problem
    Sun, Jian
    Gutin, Gregory
    Li, Ping
    Shi, Peihao
    Zhang, Xiaoyan
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 180 - 190
  • [26] LP-based pivoting algorithm for higher-order correlation clustering
    Takuro Fukunaga
    Journal of Combinatorial Optimization, 2019, 37 : 1312 - 1326
  • [27] LP-based pivoting algorithm for higher-order correlation clustering
    Fukunaga, Takuro
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (04) : 1312 - 1326
  • [28] LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering
    Fukunaga, Takuro
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 51 - 62
  • [29] An LP-based Online Dispatching Method with Privacy-preserving in Online Ride-hailing
    Chen, Xinyu
    Xu, Evan Yifan
    Tao, Jun
    Chen, Rujie
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 862 - 867
  • [30] A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem
    Sun, Jian
    Gutin, Gregory
    Zhang, Xiaoyan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 641 - 652
12345