Scheduling tasks on two processors with deadlines and additional resources

This publication has 9 references indexed in Scilit:

• A simplified NP-complete satisfiability problem
  Discrete Applied Mathematics, 1984
• Preemptive Scheduling, Linear Programming and Network Flows
  SIAM Journal on Algebraic Discrete Methods, 1984
• Some new results in flow shop scheduling
  Mathematical Methods of Operations Research, 1984
• A linear time algorithm for restricted bin packing and scheduling problems
  Operations Research Letters, 1983
• Scheduling subject to resource constraints: classification and complexity
  Discrete Applied Mathematics, 1983
• Deadline scheduling of tasks with ready times and resource constraints
  Information Processing Letters, 1979
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  Published by Elsevier ,1979
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
  ACM Transactions on Mathematical Software, 1977
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
  SIAM Journal on Computing, 1975