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.
Original language | Undefined |
---|---|
Article number | 10.1016/j.ipl.2009.07.006 |
Pages (from-to) | 1125-1128 |
Number of pages | 4 |
Journal | Information processing letters |
Volume | 109 |
Issue number | 19 |
DOIs | |
Publication status | Published - 15 Sept 2009 |
Keywords
- EWI-16449
- IR-68276
- METIS-264119