A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates.
Rabia NessahFarouk YalaouiChengbin ChuPublished in: Comput. Oper. Res. (2008)
Keyphrases
- minimize total
- release dates
- branch and bound algorithm
- identical parallel machines
- single machine scheduling problem
- precedence constraints
- lower bound
- branch and bound
- sequence dependent setup times
- upper bound
- optimal solution
- np hard
- single machine
- combinatorial optimization
- lagrangian relaxation
- setup times
- strongly np hard
- processing times
- search algorithm
- genetic algorithm