Pages that link to "Item:Q3340132"
From MaRDI portal
The following pages link to Scheduling Independent Tasks on Uniform Processors (Q3340132):
Displaying 28 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
- Parametric bounds for LPT scheduling on uniform processors (Q1179414) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Scheduling job classes on uniform machines (Q1761112) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- A note on LPT scheduling (Q5903677) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)