Login / Signup
Estimating expected completion times with probabilistic job routing.
Nirmal Govind
Theresa M. Roeder
Published in:
WSC (2006)
Keyphrases
</>
completion times
single machine scheduling problem
absolute deviation
processing times
single machine
scheduling problem
release times
weighted sum
flowshop
probabilistic model
shortest processing time
queue length
release dates
resource consumption
shortest path
special case
scheduling jobs
routing algorithm