The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine.

Jianfeng Ren Yuzhong Zhang Guo Sun

Published in: Asia Pac. J. Oper. Res. (2009)

Keyphrases

np hardness
batch processing
np hard
completion times
approximation algorithms
material handling
worst case analysis
mixed integer
discrete tomography
single machine
genetic algorithm
bayesian networks
linear programming
particle swarm optimization