| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6897911 | European Journal of Operational Research | 2013 | 31 Pages |
Abstract
⺠We study a variant of the online generalized assignment problem with a service consecution constraint. ⺠We investigate both deterministic and randomized online strategies for this problem. ⺠The deterministic strategy proposed in our paper is optimal, in terms of the worst case competitive ratio. ⺠Computational tests show that our proposed strategies have very good practical performance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Feifeng Zheng, Yongxi Cheng, Yinfeng Xu, Ming Liu,