Pages that link to "Item:Q2784469"
From MaRDI portal
The following pages link to On-Line Load Balancing in a Hierarchical Server Topology (Q2784469):
Displayed 28 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- On-line hierarchical job scheduling on grids with admissible allocation (Q600844) (← links)
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- On-line load balancing of temporary tasks revisited (Q5958311) (← links)