An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.
Mohamed HaouariAnis GharbiPublished in: Oper. Res. Lett. (2003)
Keyphrases
- maximum lateness
- max flow
- single machine
- competitive ratio
- lower bound
- release dates
- scheduling problem
- completion times
- branch and bound algorithm
- processing times
- precedence constraints
- single machine scheduling problem
- flowshop
- energy minimization
- sequence dependent setup times
- upper bound
- parallel machines
- np hard
- graph cuts
- setup times
- dynamic programming
- image segmentation
- optimal solution
- objective function