Semi-online scheduling with known maximum job size on two uniform machines
From MaRDI portal
Publication:613661
DOI10.1007/S10878-009-9214-0zbMATH Open1206.90040OpenAlexW1970469043MaRDI QIDQ613661FDOQ613661
Authors: Qian Cao, Zhaohui Liu 
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
Recommendations
- Semi-online scheduling on two uniform machines with the known largest size
- Semi-online scheduling with bounded job sizes on two uniform machines
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
Cites Work
- 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
- Bounds for List Schedules on Uniform Processors
- Randomized on-line scheduling on two uniform machines
- Semi-online scheduling with ``end of sequence information
- Optimal non-preemptive semi-online scheduling on two related machines
- Semi-on-line scheduling with ordinal data on two uniform machines
- A linear compound algorithm for uniform machine scheduling
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
Cited In (14)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- Semi-online scheduling with known partial information about job sizes on two identical machines
- A survey on makespan minimization in semi-online environments
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
- Semi-online scheduling with bounded job sizes on two uniform machines
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Preemptive semi-online algorithms for parallel machine scheduling with known total size
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
- Semi-online machine covering on two uniform machines with known total size
- Semi-online scheduling problems on two uniform machines under a grade of service provision
This page was built for publication: Semi-online scheduling with known maximum job size on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613661)
