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

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

0.00 Avg rating0 Votes
Article ID: iaor20032805
Country: Netherlands
Volume: 31
Issue: 4
Start Page Number: 323
End Page Number: 326
Publication Date: Jul 2003
Journal: Operations Research Letters
Authors: , , ,
Keywords: combinatorial analysis
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. W provide an O(n5) time algorithm to solve this problem.

Reviews

Required fields are marked *. Your email address will not be published.