Abstract
In this paper we consider the problem of scheduling jobs with and without release dates on parallel unbounded batch processing machines to minimize total completion time. We show that the problem with release dates is strongly NP-hard by a reduction from the strongly NP-hard 3-Partition problem and develop a dynamic programming algorithm for the problem without release dates.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
