The 2-valued case of makespan minimization with assignment constraints.

Stavros G. Kolliopoulos Yannis Moysoglou

Published in: Inf. Process. Lett. (2013)

Keyphrases

makespan minimization
polynomially solvable
np hard
special case
processing times
np complete
polynomial time approximation
optimal solution
scheduling problem
cost function
parallel machines
job shop scheduling problem