When to arrive at a queue with earliness, tardiness and waiting costs.
Eliran SherzerYoav KernerPublished in: CoRR (2017)
Keyphrases
- earliness tardiness
- single server
- parallel machines
- waiting times
- scheduling problem
- single machine
- holding cost
- release dates
- single server queue
- state dependent
- processing times
- steady state
- single machine scheduling problem
- special case
- precedence constraints
- total cost
- parallel computing
- shared memory
- finite buffer
- queue length
- queueing model
- flowshop
- search space
- queueing networks
- expected cost
- np hard
- resource consumption
- setup cost
- markov chain
- graphical models
- dynamic programming