Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties.
Tzvi AlonMoshe HavivPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- maximum lateness
- single machine
- single server
- scheduling problem
- single server queue
- release dates
- parallel machines
- processing times
- markov chain
- service times
- minimize total
- total weighted tardiness
- release times
- scheduling jobs
- total tardiness
- earliness tardiness
- deteriorating jobs
- sequence dependent setup times
- single machine scheduling problem
- state dependent
- steady state
- rolling horizon
- identical parallel machines
- identical machines
- special case
- learning effect
- setup times
- precedence constraints
- completion times
- production scheduling
- flowshop
- dynamic programming
- queue length
- weighted number of tardy jobs
- queueing networks
- job shop
- competitive ratio
- upper bound
- lower bound
- number of late jobs
- shortest processing time