A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines.
Eduardo CondePublished in: Optim. Lett. (2014)
Keyphrases
- unrelated parallel machines
- minmax regret
- single machine scheduling problem
- scheduling problem
- completion times
- parallel machines
- interval data
- setup times
- single machine
- optimization criterion
- precedence constraints
- open shop
- mixed integer programming
- release dates
- processing times
- combinatorial optimization problems
- scheduling jobs
- branch and bound algorithm
- flowshop
- job shop
- lagrangian relaxation
- shortest path problem
- feasible solution
- genetic algorithm
- column generation
- evolutionary algorithm
- simulated annealing
- combinatorial optimization
- identical parallel machines
- hybrid algorithm
- resource consumption
- lp relaxation