|
|||||
|
|
A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity |
|
| Authors: | Chung Keung Poon Wenci Yu |
| Affiliation: | (1) Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China;(2) Institute of Applied Mathematics, East China University of Science and Technology, 130 Meilong Road, Shanghai, 200237, China |
| Abstract: | We study on-line scheduling on a batch machine with infinite capacity. We present a flexible on-line scheduling algorithm that aims at minimizing the makespan and achieves the optimal competitive ratio of  . This research is substantially supported by a grant from City University of Hong Kong (Grant No. 7001119). The second author is supported by this grant and by the Natural Science Foundation of China. |
| Keywords: | scheduling batch makespan on-line unbounded capacity |
| 本文献已被 SpringerLink 等数据库收录！ | |