Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness.

Rubén Ruiz Ali Allahverdi

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

Keyphrases

maximum tardiness
bicriteria
upper bound
efficient solutions
integer linear programming
flowshop
knapsack problem
lower bound
scheduling problem
completion times
shortest path problem
worst case
branch and bound
branch and bound algorithm
np hard