| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427715 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
