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 条
  • [41] On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
    Uma, R. N.
    Wein, Joel
    Williamson, David P.
    THEORETICAL COMPUTER SCIENCE, 2006, 361 (2-3) : 241 - 256
  • [42] Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms
    Murray, Riley
    Khuller, Samir
    Chao, Megan
    ALGORITHMICA, 2018, 80 (10) : 2777 - 2798
  • [43] Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms
    Riley Murray
    Samir Khuller
    Megan Chao
    Algorithmica, 2018, 80 : 2777 - 2798
  • [44] A fast LP-based solution to the production planning problem with capacity constraints including setup considerations
    Padron, Mario
    Resto, Pedro
    Munoz, Jennifer
    JOURNAL OF MANUFACTURING TECHNOLOGY MANAGEMENT, 2012, 23 (02) : 253 - 266
  • [45] A novel genetic algorithm for the hybrid flow shop scheduling with parallel batching and eligibility constraints
    Antonio Costa
    Fulvio Antonio Cappadonna
    Sergio Fichera
    The International Journal of Advanced Manufacturing Technology, 2014, 75 : 833 - 847
  • [46] A novel genetic algorithm for the hybrid flow shop scheduling with parallel batching and eligibility constraints
    Costa, Antonio
    Cappadonna, Fulvio Antonio
    Fichera, Sergio
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 75 (5-8): : 833 - 847
  • [47] An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters
    Borgwardt, Steffen
    OPERATIONAL RESEARCH, 2022, 22 (02) : 1511 - 1551
  • [48] An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters
    Steffen Borgwardt
    Operational Research, 2022, 22 : 1511 - 1551
  • [49] Online Scheduling and Optimality Analysis for NOMA-Based MEC Systems
    Hua, Meihui
    Tian, Hui
    Ni, Wanli
    2021 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2021,
  • [50] LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
    Boland, Natashia
    Dumitrescu, Irina
    Froyland, Gary
    Gleixner, Ambros M.
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (04) : 1064 - 1089
12345