Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.
John L. BrunoPeter J. DowneyGreg N. FredericksonPublished in: J. ACM (1981)
Keyphrases
- service times
- steady state
- queue length
- priority queue
- processor sharing
- service rates
- queueing model
- processing times
- processor sharing queue
- waiting times
- completion times
- optimal solution
- single machine
- single server
- markov chain
- scheduling problem
- poisson arrivals
- random variables
- queueing systems
- wireless sensor networks
- lower bound
- objective function
- information systems