Login / Signup

An efficient burst-arrival and batch-departure algorithm for round-robin service.

Jorge R. RamosVernon RegoJanche Sang
Published in: Simul. Model. Pract. Theory (2006)
Keyphrases
  • round robin
  • search space
  • scheduling policies
  • web services
  • optimal solution
  • k means
  • search strategy
  • scheduling strategy
  • learning algorithm
  • simulated annealing
  • background knowledge