Complexity of scheduling on parallel identical machines to minimize total flow time with interval data and minmax regret criterion.
Maciej DrwalPublished in: CoRR (2014)
Keyphrases
- identical machines
- minmax regret
- minimize total
- single machine
- single machine scheduling problem
- interval data
- processing times
- release dates
- optimization criterion
- scheduling problem
- precedence constraints
- setup times
- parallel machines
- shortest path problem
- dynamic programming
- multivariate data
- temporal data
- utility function
- combinatorial optimization problems
- branch and bound algorithm
- worst case
- computational complexity
- objective function
- data clustering