Semi-online scheduling with bounded job sizes on two uniform machines
From MaRDI portal
Publication:338376
DOI10.1016/J.TCS.2016.08.022zbMATH Open1356.90052OpenAlexW2512747565MaRDI QIDQ338376FDOQ338376
Authors: Qian Cao, Zhaohui Liu 
Publication date: 4 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.022
Recommendations
- Semi-online scheduling with known maximum job size on two uniform machines
- Semi-online scheduling on two uniform machines with the known largest size
- Two semi-online scheduling problems on two uniform machines
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- Semi-online scheduling on two uniform processors
Cites Work
- Bounds for LPT Schedules on Uniform Processors
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
- Bounds for List Schedules on Uniform Processors
- Randomized on-line scheduling on two uniform machines
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- The optimal on-line parallel machine scheduling
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Bounds on Schedules for Independent Tasks with Similar Execution Times
- Optimal non-preemptive semi-online scheduling on two related machines
- Semi-online scheduling with known maximum job size on two uniform machines
- Optimal preemptive semi-online scheduling on two uniform processors
Cited In (9)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A survey on makespan minimization in semi-online environments
- Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Semi-online scheduling with known maximum job size on two uniform machines
- Title not available (Why is that?)
- Semi-online scheduling: a survey
- 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
This page was built for publication: Semi-online scheduling with bounded job sizes on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338376)
