The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective.
Jordi PereiraPublished in: Comput. Oper. Res. (2016)
Keyphrases
- processing times
- minmax regret
- single machine scheduling problem
- interval data
- completion times
- single machine
- scheduling problem
- resource consumption
- release dates
- scheduling jobs
- setup times
- release times
- total weighted tardiness
- sequence dependent setup times
- flowshop
- shortest path problem
- competitive ratio
- precedence constraints
- multiple objectives
- identical machines
- temporal data
- tabu search
- np complete