Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times

This publication has 8 references indexed in Scilit:

• Fixed Job Scheduling with Two Types of Processors
  Operations Research, 1992
• When Is the Classroom Assignment Problem Hard?
  Operations Research, 1992
• On the computational complexity of (maximum) class scheduling
  European Journal of Operational Research, 1991
• Scheduling jobs with fixed start and end times
  Discrete Applied Mathematics, 1987
• The Complexity of Coloring Circular Arcs and Chords
  SIAM Journal on Algebraic Discrete Methods, 1980
• An Optimal Solution for the Channel-Assignment Problem
  IEEE Transactions on Computers, 1979
• Minimal Resources for Fixed and Variable Job Schedules
  Operations Research, 1978
• Coloring a Family of Circular Arcs
  SIAM Journal on Applied Mathematics, 1975