Article ID: | iaor20081247 |
Country: | United Kingdom |
Volume: | 9 |
Issue: | 6 |
Start Page Number: | 499 |
End Page Number: | 513 |
Publication Date: | Dec 2006 |
Journal: | Journal of Scheduling |
Authors: | Cheng T.C.E., Yuan J.J., Ng C.T., Liu Z.H. |
Keywords: | heuristics, programming: dynamic |
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an