On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

摘要

We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.