Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions.
Imed KacemNizar SouayahMohamed HaouariPublished in: RAIRO Oper. Res. (2012)
Keyphrases
- total weighted tardiness
- release dates
- branch and bound algorithm
- parallel machines
- precedence constraints
- sequence dependent setup times
- single machine scheduling problem
- scheduling problem
- lower bound
- np hard
- branch and bound
- maximum lateness
- parallel machine scheduling problem
- single machine
- upper bound
- optimal solution
- setup times
- combinatorial optimization
- lagrangian relaxation
- objective function
- shared memory
- single server
- parallel computing
- flowshop
- lot sizing
- search space