A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents.
Wen-Chiung LeeJen-Ya WangMei-Chun LinPublished in: Knowl. Based Syst. (2016)
Keyphrases
- identical machines
- partially ordered
- precedence constraints
- branch and bound algorithm
- release dates
- single machine scheduling problem
- maximum lateness
- processing times
- setup times
- np hard
- sequence dependent setup times
- lower bound
- branch and bound
- resource allocation
- upper bound
- single machine
- combinatorial optimization
- genetic algorithm
- lagrangian relaxation
- polynomial time approximation
- optimal solution
- upper bounding
- search tree
- completion times
- parallel machines
- approximation algorithms
- scheduling problem
- multi objective
- evolutionary algorithm
- reinforcement learning