Single machine scheduling with two competing agents, arbitrary release dates and unit processing times.
Omri DoverDvir ShabtayPublished in: Ann. Oper. Res. (2016)
Keyphrases
- processing times
- release dates
- single machine
- single machine scheduling problem
- scheduling problem
- scheduling jobs
- total weighted tardiness
- precedence constraints
- setup times
- makespan minimization
- sequence dependent setup times
- earliness tardiness
- release times
- polynomially solvable
- identical machines
- completion times
- flowshop
- job processing times
- np hard
- parallel machines
- dynamic programming