Online scheduling on parallel machines with two goS levels

DOI10.1007/s10878-007-9095-zzbMath1176.90221MaRDI QIDQ941832

Yiwei Jiang

Publication date: 2 September 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9095-z

zbMATH Keywords

competitive analysis; online algorithm; parallel machine scheduling; grade of service

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION, Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Mixed coordination mechanisms for scheduling games on hierarchical machines, Bin stretching with migration on two hierarchical machines, On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines, Semi-online scheduling with two GoS levels and unit processing time, A note on hierarchical scheduling on two uniform machines, Online hierarchical scheduling: an approach using mathematical programming, Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times, Online and semi-online hierarchical scheduling for load balancing on uniform machines, Improved bounds for online scheduling with eligibility constraints, Online parallel machines scheduling with two hierarchies, Scheduling parallel machines with inclusive processing set restrictions and job release times, Total completion time minimization scheduling on two hierarchical uniform machines, Online scheduling of two job types on a set of multipurpose machines with unit processing times, On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints, An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times, Online scheduling on uniform machines with two hierarchies, An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies, Online scheduling with migration on two hierarchical machines, Worst-case analysis for on-line service policies, Heuristics for online scheduling on identical parallel machines with two GoS levels, On-line booking policies and competitive analysis of medical examination in hospital, Optimal online algorithms on two hierarchical machines with tightly-grouped processing times, Total completion time minimization in online hierarchical scheduling of unit-size jobs, Optimal algorithms for semi-online machine covering on two hierarchical machines, Online scheduling on two parallel identical machines under a grade of service provision, OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• Online and semi-online scheduling of two machines under a grade of service provision
• On-line algorithms for the channel assignment problem in cellular networks.
• Parallel machine scheduling under a grade of service provision
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• On-Line Load Balancing in a Hierarchical Server Topology
• The Competitiveness of On-Line Assignments
• Blow up of solutions to the Cauchy problem for nonlinear wave equations