A theoretical development for the total tardiness problem and its application in branch and bound algorithms.

Shuyu Zhou Zhaohui Liu

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

Keyphrases

branch and bound algorithm
total tardiness
branch and bound
lower bound
upper bound
single machine
parallel machines
set covering problem
combinatorial optimization
evolutionary algorithm
np hard
scheduling problem
multi item
setup times
boolean satisfiability
haplotype inference