Online parallel machines scheduling with two hierarchies
From MaRDI portal
Publication:837151
DOI10.1016/J.TCS.2009.04.007zbMATH Open1171.68006OpenAlexW2093055936MaRDI QIDQ837151FDOQ837151
Zhiyi Tan, Yiwei Jiang, An Zhang
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
Recommendations
- Online scheduling on uniform machines with two hierarchies
- Optimal online algorithms for hierarchical scheduling on three parallel machines
- Online hierarchical scheduling on two uniform machines with bounded job sizes
- A note on hierarchical scheduling on two uniform machines
- Online fractional hierarchical scheduling on uniformly related machines
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- On-line scheduling revisited
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- Parallel machine scheduling under a grade of service provision
- Improved Bounds for the Online Scheduling Problem
- New lower and upper bounds for on-line scheduling
- On-line algorithms for the channel assignment problem in cellular networks.
- On randomized online scheduling
- The hierarchical model for load balancing on two machines
Cited In (31)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
- Makespan minimization in online scheduling with machine eligibility
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Online scheduling with unit processing times and processing set restrictions
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Optimal online algorithms on two hierarchical machines with resource augmentation
- On-line booking policies and competitive analysis of medical examination in hospital
- A Mathematical Programming Approach for Online Hierarchical Scheduling
- Online early work maximization on three hierarchical machines with a common due date
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Online scheduling on two parallel identical machines under a grade of service provision
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- Bin stretching with migration on two hierarchical machines
- Online hierarchical scheduling: an approach using mathematical programming
- Title not available (Why is that?)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Total completion time minimization scheduling on two hierarchical uniform machines
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
- Online MapReduce processing on two identical parallel machines
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- Online scheduling on uniform machines with two hierarchies
- Makespan minimization in online scheduling with machine eligibility
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Online scheduling with migration on two hierarchical machines
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Optimal algorithms for semi-online machine covering on two hierarchical machines
- Semi-online scheduling with two GoS levels and unit processing time
This page was built for publication: Online parallel machines scheduling with two hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837151)
