A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion.
Adam KasperskiPawel ZielinskiPublished in: Oper. Res. Lett. (2008)
Keyphrases
- minmax regret
- interval data
- optimization criterion
- shortest path problem
- cost function
- shortest path
- optimal solution
- data clustering
- dynamic programming
- benchmark problems
- single machine scheduling problem
- search space
- np hard
- hybrid algorithm
- multi objective
- k means
- principal component analysis
- expectation maximization
- genetic algorithm