A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

摘要

We consider the single machine, serial batching, maximum lateness scheduling problem with precedence constraints in this paper. The complexity of this problem is reported as open in the literature. We give an O(n2) polynomial-time algorithm for this problem.