Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
From MaRDI portal
Publication:491212
DOI10.1007/s10878-009-9265-2zbMath1319.90030OpenAlexW2011250895MaRDI QIDQ491212
György Dósa, M. Grazia Speranza, Zsolt Tuza
Publication date: 24 August 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9265-2
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
A survey on makespan minimization in semi-online environments, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Semi-online scheduling: a survey, Semi-online scheduling problems on two uniform machines under a grade of service provision, Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time, Online bin stretching with bunch techniques, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Cites Work
- Unnamed Item
- Unnamed Item
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Two semi-online scheduling problems on two uniform machines
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Semi-online algorithms for parallel machine scheduling problems
- Semi-online scheduling on two uniform processors
- Bounds for List Schedules on Uniform Processors
- Bounds for Certain Multiprocessing Anomalies
- Randomized on-line scheduling on two uniform machines
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
- On-line bin-stretching
