Article ID: | iaor20125347 |
Volume: | 15 |
Issue: | 5 |
Start Page Number: | 653 |
End Page Number: | 664 |
Publication Date: | Oct 2012 |
Journal: | Journal of Scheduling |
Authors: | Drr Christoph, Jez Lukasz, Thang Nguyen |
Keywords: | combinatorial optimization, internet |
We consider an online scheduling problem, motivated by the issues present at the joints of networks using ATM and TCP/IP. Namely, IP packets have to be broken down into small ATM cells and sent out before their deadlines, but cells corresponding to different packets can be interwoven. More formally, we consider the online scheduling problem with preemptions, where each job