NP-complete scheduling problems
Jeffrey David Ullman · Journal of Computer and System Sciences · 1975
Cited by 1,452 works. doi:10.1016/s0022-0000(75)80008-0 Open-access PDF
Authors
References
- The Design and Analysis of Computer Algorithms
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- Optimal scheduling for two-processor systems
- Bounds on multiprocessing anomalies and related packing algorithms
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Scheduling independent tasks to reduce mean finishing time
- Optimal Sequencing of Two Equivalent Processors
- Complete register allocation problems
- Bounds on multiprocessing anomalies and packing algorithms