Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times.
Jeffrey W. HerrmannPublished in: J. Sched. (2012)
Keyphrases
- service times
- traffic intensity
- steady state
- fluid model
- heavy traffic
- queueing networks
- queue length
- scheduling policies
- parallel machines
- single server
- service rates
- priority queue
- arrival rate
- stationary distribution
- processor sharing
- traffic load
- random variables
- queueing model
- queueing systems
- call center
- waiting times
- arrival process
- poisson arrivals
- processor sharing queue
- single server queue
- parallel computing
- markov chain
- routing protocol
- optimal policy
- arrival processes
- state dependent
- independent and identically distributed
- response time
- scheduling problem
- shared memory
- ad hoc networks
- flowshop
- network topology
- lower bound
- reinforcement learning
- information systems