Algorithms minimizing mean flow time: schedule-length properties
E. G. Coffman, Ravi Sethi · Acta Informatica · 1976
Cited by 48 works. doi:10.1007/bf00263740
Authors
References
- Reducibility among Combinatorial Problems
- Theory of scheduling
- Bounds on multiprocessing anomalies and related packing algorithms
- NP-complete scheduling problems
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Scheduling independent tasks to reduce mean finishing time
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Algorithms for Minimizing Mean Flow Time.
- Information Processing