Optimal online-list batch scheduling |
| |
| Authors: | Jacob Jan Paulus Deshi Ye Guochuan Zhang |
| |
| Affiliation: | aUniversity of Twente, PO Box 217, 7500AE Enschede, The Netherlands;bCollege of Computer Science, Zhejiang University, Hangzhou 310027, China |
| |
| 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. |
| |
| Keywords: | Batch scheduling Online algorithms Competitive analysis |
| 本文献已被 ScienceDirect 等数据库收录！ |
