Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
From MaRDI portal
Publication:1889769
DOI10.1007/S00236-003-0134-7zbMATH Open1072.68022OpenAlexW1992125546MaRDI QIDQ1889769FDOQ1889769
Authors: Yong He, Yiwei Jiang 
Publication date: 9 December 2004
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-003-0134-7
Recommendations
- Optimal preemptive semi-online scheduling on two uniform processors
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Two semi-online scheduling problems on two uniform machines
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)
Cited In (23)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
- Semi-online preemptive scheduling: one algorithm for all variants
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
- Semi-online preemptive scheduling: one algorithm for all variants
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Preemptive online algorithms for scheduling with machine cost
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- The online knapsack problem: advice and randomization
- 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
- Optimal non-preemptive semi-online scheduling on two related machines
- Title not available (Why is that?)
- Optimal preemptive semi-online scheduling on two uniform processors
- Semi-online scheduling: a survey
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Preemptive machine covering on parallel machines
This page was built for publication: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889769)
