Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion.
Marcin SiepakJerzy JózefczykPublished in: Ann. Oper. Res. (2014)
Keyphrases
- scheduling problem
- processing times
- flowshop
- single machine
- parallel machines
- minmax regret
- interval data
- earliness tardiness
- setup times
- identical machines
- completion times
- release dates
- single machine scheduling problem
- optimization criterion
- identical parallel machines
- total weighted tardiness
- computational complexity
- tabu search
- strongly np hard
- makespan minimization
- precedence constraints
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- np hard
- solution quality
- data clustering
- worst case