Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
From MaRDI portal
Publication:837179
DOI10.1016/j.tcs.2009.05.023zbMath1172.68007OpenAlexW2009679762WikidataQ57185761 ScholiaQ57185761MaRDI QIDQ837179
Chengbin Chu, Ming Liu, Feifeng Zheng, Yin-Feng Xu
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line scheduling to minimize average completion time revisited.
- On-line scheduling of parallel machines to minimize total completion times
- Online scheduling of two uniform machines to minimize total completion times
- On-line preemptive scheduling on uniform machines
- A class of on-line scheduling algorithms to minimize total completion time
- Approximation Techniques for Average Completion Time Scheduling
- LP-Based Online Scheduling: From Single to Parallel Machines
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Minimizing the total completion time on-line on a single machine, using restarts