On Scheduling with Release Times and Deadlines

This publication has 8 references indexed in Scilit:

• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
  SIAM Journal on Computing, 1981
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
  Journal of the ACM, 1979
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
  SIAM Journal on Computing, 1978
• Two-Processor Scheduling with Start-Times and Deadlines
  SIAM Journal on Computing, 1977
• Complexity of Machine Scheduling Problems
  Published by Elsevier ,1977
• NP-complete scheduling problems
  Journal of Computer and System Sciences, 1975
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971