Login / Signup

Optimal preemptive scheduling on a fixed number of identical parallel machines.

Aziz MoukrimAlain Quilliot
Published in: Oper. Res. Lett. (2005)
Keyphrases
  • fixed number
  • identical parallel machines
  • preemptive scheduling
  • finite number
  • scheduling jobs
  • competitive ratio
  • dynamic programming
  • search algorithm
  • scheduling problem
  • worst case
  • steady state
  • strongly np hard