A fast algorithm for single processor scheduling
Barbara B. Simons · Annual Symposium on Foundations of Computer Science · 1978
Cited by 96 works. doi:10.1109/sfcs.1978.4
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- The Design and Analysis of Computer Algorithms
- Reducibility among Combinatorial Problems
- Reducibility Among Combinatorial Problems
- Complexity of Machine Scheduling Problems
- Some simple scheduling algorithms
- Sequencing with due‐dates and early start times to minimize maximum tardiness
- Two-Processor Scheduling with Start-Times and Deadlines
- Minimizing maximum lateness on one machine: computational experience and some applications
- Job-Shop Scheduling by Implicit Enumeration