A polynomial-time algorithm for a flow-shop batching problem with equal-length operations.

Peter Brucker Natalia V. Shakhlevich

Published in: J. Sched. (2011)

Keyphrases

equal length
computational complexity
worst case
flowshop
scheduling problem
cost function
makespan minimization
optimal solution
np hard
linear programming
hybrid algorithm
job shop
open shop