Online parallel machines scheduling with two hierarchies
From MaRDI portal
Publication:837151
DOI10.1016/j.tcs.2009.04.007zbMath1171.68006MaRDI QIDQ837151
Zhiyi Tan, An Zhang, Yiwei Jiang
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.007
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, 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, Online hierarchical scheduling: an approach using mathematical programming, Online and semi-online hierarchical scheduling for load balancing on uniform machines, Total completion time minimization scheduling on two hierarchical uniform machines, Fast approximation algorithms for uniform machine scheduling with processing set restrictions, 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, 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, OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION, Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
Cites Work
- Unnamed Item
- Online and semi-online scheduling of two machines under a grade of service provision
- The hierarchical model for load balancing on two machines
- Online scheduling on parallel machines with two goS levels
- On-line algorithms for the channel assignment problem in cellular networks.
- On-line scheduling revisited
- Parallel machine scheduling under a grade of service provision
- New lower and upper bounds for on-line scheduling
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
- On randomized online scheduling
- The Competitiveness of On-Line Assignments
- Improved Bounds for the Online Scheduling Problem
- Parallel machine scheduling with job assignment restrictions
- Bounds for Certain Multiprocessing Anomalies
