Optimal online-list batch scheduling
Paulus, Jacob Jan and Ye, Deshi and Zhang, Guochuan (2008) Optimal online-list batch scheduling. [Report]
| PDF 116Kb |
| 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. |
| Item Type: | Report |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/65146 |
| Publisher URL: | http://beta.ieis.tue.nl/node/1160 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Repository Staff Only: item control page
Metis ID: 254920

Show download statistics for this publication
Show download statistics for this publication