Online scheduling with general cost functions
From MaRDI portal
(Redirected from Publication:5743474)
Online scheduling with general cost functions (scientific article; zbMATH DE number 7053351)
Online scheduling with general cost functions (scientific article; zbMATH DE number 7053351)
Recommendations
Cites work
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- A unified approach to scheduling on unrelated parallel machines
- All-norm approximation algorithms
- Approximation algorithms for average stretch scheduling
- Better Scalable Algorithms for Broadcast Scheduling
- Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work
- Online scheduling with general cost functions
- Online weighted flow time and deadline scheduling
- Poisson Disorder Problem with Exponential Penalty for Delay
- Preemptive scheduling in overloaded systems.
- Scalably scheduling processes with arbitrary speedup curves
- Scheduling heterogeneous processors isn't as easy as you think
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
- Speed is as powerful as clairvoyance
Cited in
(10)- Online scheduling with general machine cost functions
- Non-clairvoyantly scheduling to minimize convex functions
- An improved algorithm for online machine minimization
- Online non-clairvoyant scheduling to simultaneously minimize all convex functions
- On-line scheduling with setup costs
- On-line scheduling with general machine cost functions
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- Online scheduling with general cost functions
- LATIN 2004: Theoretical Informatics
- Online weighted flow time and deadline scheduling
This page was built for publication: Online scheduling with general cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743474)
