The minmax regret permutation flow-shop problem with two jobs.
Igor AverbakhPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- minmax regret
- single machine scheduling problem
- processing times
- branch and bound algorithm
- interval data
- scheduling problem
- single machine
- flowshop
- optimization criterion
- precedence constraints
- branch and bound
- lower bound
- resource consumption
- optimal solution
- combinatorial optimization problems
- resource allocation problems
- np hard
- combinatorial optimization
- shortest path problem
- unsupervised learning
- search algorithm
- upper bound
- cost function
- genetic algorithm
- random variables
- video sequences