Semi-online scheduling on two uniform processors
From MaRDI portal
Publication:2481966
DOI10.1016/j.tcs.2007.12.005zbMath1136.68014OpenAlexW2036784014MaRDI QIDQ2481966
Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.005
Related Items
A survey on makespan minimization in semi-online environments, Online scheduling on two uniform machines subject to eligibility constraints, 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, Dynamic scheduling of patients in emergency departments, General parametric scheme for the online uniform machine scheduling problem with two different speeds, Semi-online scheduling revisited, Semi-online scheduling on two uniform machines with the known largest size, Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling, Online scheduling with a buffer on related machines, Online scheduling on two uniform machines to minimize the makespan, 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
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Preemptive on-line scheduling for two uniform processors
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Semi-online algorithms for parallel machine scheduling problems
- 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
