Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability.
Asmaa KhoudiAli BerrichiPublished in: Int. J. Manuf. Res. (2020)
Keyphrases
- branch and bound algorithm
- parallel machine scheduling problem
- precedence constraints
- single machine scheduling problem
- sequence dependent setup times
- release dates
- total weighted tardiness
- lagrangian relaxation
- maximum lateness
- scheduling problem
- lower bound
- branch and bound
- np hard
- upper bound
- optimal solution
- combinatorial optimization
- parallel machines
- single machine
- max sat
- search space
- setup times
- search algorithm
- neural network
- valid inequalities
- linear programming
- computational complexity