A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan.
Onur OzturkMehmet A. BegenGregory S. ZaricPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- precedence constraints
- identical machines
- branch and bound algorithm
- lower bound
- scheduling problem
- release dates
- branch and bound
- np hard
- parallel machines
- maximum clique
- parallel processors
- sequence dependent setup times
- upper bound
- maximum lateness
- scheduling jobs
- single machine scheduling problem
- optimal solution
- setup times
- single machine
- combinatorial optimization
- lower bounding
- identical parallel machines
- upper bounding
- dominance rules
- batch processing machines
- variable ordering
- approximation algorithms
- strongly np hard
- mixed integer linear programming
- randomly generated problems
- lagrangian relaxation
- flowshop
- max sat
- branch and bound method
- partial order
- linear programming
- finding an optimal solution
- computational complexity