Greed in resource scheduling
From MaRDI portal
Publication:2277135
DOI10.1007/BF01261655zbMath0724.90032MaRDI QIDQ2277135
Donald W. Gillies, Jane W. S. Liu
Publication date: 1991
Published in: Acta Informatica (Search for Journal in Brave)
worst-case performanceheuristic schedulinglist-schedulingnonpreemptive tasks with precedence constraints
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 2.5 times optimal algorithm for packing in two dimensions
- List scheduling bounds for UET systems with resources
- An improved BL lower bound
- Greed in resource scheduling
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
- Concurrent Task Systems
- Bounds on Multiprocessing Timing Anomalies
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Greed in resource scheduling