Two branch-and-bound algorithms for the robust parallel machine scheduling problem.

Mohammad Ranjbar Morteza Davari Roel Leus

Published in: Comput. Oper. Res. (2012)

Keyphrases

branch and bound algorithm
branch and bound
release dates
precedence constraints
parallel machine scheduling problem
lower bound
upper bound
combinatorial optimization
single machine scheduling problem
optimal solution
scheduling problem
boolean satisfiability