Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times.
Maciej DrwalJerzy JózefczykPublished in: Ann. Oper. Res. (2020)
Keyphrases
- completion times
- number of late jobs
- processing times
- min max
- release times
- single machine
- scheduling problem
- single machine scheduling problem
- release dates
- scheduling jobs
- job processing times
- weighted sum
- flowshop
- setup times
- precedence relations
- sequence dependent setup times
- identical parallel machines
- resource consumption
- lower bound
- learning effect
- competitive ratio
- online learning
- scheduling decisions
- np hard
- parallel machines