Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion.
Maciej DrwalRoman RischkePublished in: Oper. Res. Lett. (2016)
Keyphrases
- np hard
- identical machines
- scheduling problem
- minmax regret
- interval data
- polynomial time approximation
- processing times
- worst case
- single machine
- optimization criterion
- precedence constraints
- job scheduling
- computational complexity
- branch and bound algorithm
- single machine scheduling problem
- special case
- setup times
- lower bound
- shortest path problem
- data clustering
- temporal data
- markov chain