Complexity results for scheduling tasks with discrete starting times
- 31 December 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (4) , 344-361
- https://doi.org/10.1016/0196-6774(82)90030-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- An Optimal Solution for the Channel-Assignment ProblemIEEE Transactions on Computers, 1979
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977