On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
type: Item
instance of: scholarly article
title: On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
zbMATH Open document ID: 1408.90144
author: An Zhang
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6945403
zbMATH Keywords: online scheduling
zbMATH Keywords: grade of service eligibility
zbMATH Keywords: competitive ratio
zbMATH Keywords: linear programming
MaRDI profile type: Publication
full work available at URL: j.orl.2015.07.008
OpenAlex ID: W1090409710
cites work: The Competitiveness of On-Line Assignments
cites work: On-line load balancing in a hierarchical server topology
cites work: The hierarchical model for load balancing on two machines
cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements
cites work: Preemptive scheduling on a small number of hierarchical machines
cites work: Preemptive online scheduling: Optimal algorithms for all speeds
cites work: Semi-online preemptive scheduling: one algorithm for all variants
cites work: Online and semi-online hierarchical scheduling for load balancing on uniform machines
cites work: Online scheduling on uniform machines with two hierarchies
cites work: A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
cites work: Parallel machine scheduling under a grade of service provision
cites work: Online scheduling on parallel machines with two goS levels
cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service
cites work: Makespan minimization in online scheduling with machine eligibility
cites work: Improved bounds for online scheduling with eligibility constraints
cites work: Semi-online scheduling problems on two uniform machines under a grade of service provision
cites work: Online and semi-online scheduling of two machines under a grade of service provision
cites work: A note on hierarchical scheduling on two uniform machines
cites work: Online hierarchical scheduling: an approach using mathematical programming
cites work: Optimal algorithms for semi-online machine covering on two hierarchical machines
cites work: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
cites work: Online parallel machines scheduling with two hierarchies
DOI: 10.1016/J.ORL.2015.07.008
description: scientific article; zbMATH DE number 6945403