Article ID: | iaor20083050 |
Country: | United Kingdom |
Volume: | 10 |
Issue: | 4/5 |
Start Page Number: | 263 |
End Page Number: | 269 |
Publication Date: | Oct 2007 |
Journal: | Journal of Scheduling |
Authors: | Tuza Zsolt, Speranza Maria Grazia, Angelelli Enrico |
We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound