Semi-online scheduling on two uniform processors
From MaRDI portal
Publication:2481966
DOI10.1016/J.TCS.2007.12.005zbMATH Open1136.68014OpenAlexW2036784014MaRDI QIDQ2481966FDOQ2481966
Authors: Zsolt Tuza, Enrico Angelelli, Maria Grazia Speranza 
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
Recommendations
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
- Optimal preemptive semi-online scheduling on two uniform processors
- Geometric representation for semi on-line scheduling on uniform processors
Cites Work
- Bounds for Certain Multiprocessing Anomalies
- Bounds for List Schedules on Uniform Processors
- Randomized on-line scheduling on two uniform machines
- Semi on-line scheduling on two identical machines
- Semi on-line algorithms for the partition problem
- Semi-online algorithms for parallel machine scheduling problems
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Preemptive on-line scheduling for two uniform processors
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
- Title not available (Why is that?)
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
Cited In (25)
- Semi-online scheduling revisited
- Geometric representation for semi on-line scheduling on uniform processors
- Online scheduling on two uniform machines to minimize the makespan
- Semi on-line scheduling on three processors with known sum of the tasks
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A survey on makespan minimization in semi-online environments
- General parametric scheme for the online uniform machine scheduling problem with two different speeds
- Preemptive on-line scheduling for two uniform processors
- Semi-on-line scheduling with ordinal data on two uniform machines
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- Online scheduling on two uniform machines subject to eligibility constraints
- Online scheduling with a buffer on related machines
- Semi-online scheduling with bounded job sizes on two uniform machines
- New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Optimal preemptive semi-online scheduling on two uniform processors
- Two semi-online scheduling problems on two uniform machines
- Semi-online scheduling: a survey
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
- Dynamic scheduling of patients in emergency departments
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- 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
- Title not available (Why is that?)
This page was built for publication: Semi-online scheduling on two uniform processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481966)
