Online scheduling of two job types on a set of multipurpose machines with unit processing times.
Dvir ShabtayShlomo KarhiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- processing times
- identical machines
- scheduling problem
- identical parallel machines
- flowshop
- polynomially solvable
- single machine
- release dates
- scheduling jobs
- fixed number
- scheduling decisions
- release times
- single machine scheduling problem
- setup times
- precedence relations
- precedence constraints
- worst case performance ratio
- completion times
- sequence dependent setup times
- resource consumption
- parallel machines
- number of tardy jobs
- communication delays
- earliness tardiness
- search algorithm
- competitive ratio
- scheduling algorithm
- resource allocation
- online learning
- upper bound
- dynamic programming