Semi-online machine covering for two uniform machines
From MaRDI portal
Publication:1034625
DOI10.1016/J.TCS.2009.08.001zbMath1194.68083OpenAlexW1965106322MaRDI QIDQ1034625
Leah Epstein, Zhiyi Tan, Xing-Yu Chen
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.001
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Semi-online machine covering on two uniform machines with known total size
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
- The exact LPT-bound for maximizing the minimum completion time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Tight bounds for bandwidth allocation on two links
- The Santa Claus problem
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Bounds for LPT Schedules on Uniform Processors
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
- Bounds on Multiprocessing Timing Anomalies
- Optimal non-preemptive semi-online scheduling on two related machines
- On-line machine covering
- Semi-online scheduling with decreasing job sizes
This page was built for publication: Semi-online machine covering for two uniform machines
