The 2-valued case of makespan minimization with assignment constraints

Stavros G. Kolliopoulos Yannis Moysoglou

Published in: CoRR (2012)

Keyphrases

makespan minimization
polynomially solvable
np complete
processing times
np hard
metaheuristic
single machine
flowshop
minimum cost