Login / Signup

Non-preemptive scheduling to maximize the minimum global inter-completion time.

Carlos C. AmaroSanjoy K. BaruahAlexander D. StoyenWolfgang A. Halang
Published in: Autom. (2003)
Keyphrases
  • preemptive scheduling
  • single machine to minimize
  • neural network
  • machine learning
  • special case
  • upper bound