scientific article; zbMATH DE number 7053349
From MaRDI portal
zbMath1422.68319MaRDI QIDQ5743472
No author found.
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095213
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
An Optimal Control Framework for Online Job Scheduling with General Cost Functions, Rejecting jobs to minimize load and maximum flow-time, Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming, An improved greedy algorithm for stochastic online scheduling on unrelated machines, A best possible online algorithm for minimizing the total completion time and the total soft penalty cost, Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, Unnamed Item, Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality, Non-Preemptive Flow-Time Minimization via Rejections, Fair Scheduling via Iterative Quasi-Uniform Sampling, Energy efficient scheduling of parallelizable jobs, Minimizing maximum (weighted) flow-time on related and unrelated machines, Welfare maximization with production costs: a primal dual approach, Approximating \(k\)-forest with resource augmentation: a primal-dual approach, An improved approximation algorithm for scheduling under arborescence precedence constraints, Non-Clairvoyant Precedence Constrained Scheduling., Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems, Non-clairvoyantly scheduling to minimize convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing total flow time and total completion time with immediate dispatching
- Speed Scaling with an Arbitrary Power Function
- Multi-processor scheduling to minimize flow time with ε resource augmentation
- Server scheduling in the L p norm
- Speed Scaling for Weighted Flow Time
- Scalably Scheduling Power-Heterogeneous Processors
- Better Algorithms for Minimizing Average Flow-Time on Related Machines
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
- Algorithms for minimizing weighted flow time
- LATIN 2004: Theoretical Informatics
