A polynomially solvable case of the pooling problem.

Natashia Boland Thomas Kalinowski Fabian Rigterink

Published in: J. Glob. Optim. (2017)

Keyphrases

polynomially solvable
np complete
special case
processing times
np hard
makespan minimization
minimum cost
feasible solution
database
case study
scheduling problem
real time
real world
genetic algorithm
evolutionary algorithm
dynamic programming