Abstract
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( n 5) time algorithm to solve this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have