Semi-online scheduling with known maximum job size on two uniform machines
From MaRDI portal
Publication:613661
DOI10.1007/s10878-009-9214-0zbMath1206.90040OpenAlexW1970469043MaRDI QIDQ613661
Publication date: 21 December 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9214-0
Related Items (3)
A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision
Cites Work
- Unnamed Item
- A linear compound algorithm for uniform machine scheduling
- Semi-online scheduling with ``end of sequence information
- Bounds for List Schedules on Uniform Processors
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Bounds for LPT Schedules on Uniform Processors
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
- Optimal non-preemptive semi-online scheduling on two related machines
- Randomized on-line scheduling on two uniform machines
- Semi-on-line scheduling with ordinal data on two uniform machines
This page was built for publication: Semi-online scheduling with known maximum job size on two uniform machines
