Login / Signup

Error bounds on practical approximation for two tandem queue with blocking and non-preemptive priority.

Ouiza LekadirDjamil Aïssani
Published in: Comput. Math. Appl. (2011)
Keyphrases
  • error bounds
  • priority queue
  • theoretical analysis
  • priority scheduling
  • worst case
  • scheduling problem
  • service times
  • real world
  • data structure
  • polynomial time approximation
  • wavelet synopses
  • lower bound
  • single machine