| Article ID: | iaor2009274 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 51 |
| End Page Number: | 56 |
| Publication Date: | Jan 2008 |
| Journal: | Operations Research Letters |
| Authors: | Paulus J.J., Hurink J.L. |
We consider online scheduling of parallel jobs on parallel machines. For the problem with two machines and the objective of minimizing the makespan, we show that 2 is a tight lower bound on the competitive ratio. For the problem with