@inproceedings{18cd4edb8e40445080e1e6a3f910e27a,
title = "An optimal strategy for online non-uniform length order scheduling",
abstract = "This paper will study an online non-uniform length order scheduling problem. For the case where online strategies have the knowledge of Δ beforehand, which is the ratio between the longest and shortest length of order, Ting [3] proved an upper bound of and Zheng et al. [2] proved a matching lower bound. This work will consider the scenario where online strategies do not have the knowledge of Δ at the beginning. Our main work is a -competitive optimal strategy, extending the result of Ting [3] to a more general scenery.",
keywords = "Competitive Ratio, Online Strategy, Scheduling",
author = "Feifeng Zheng and E. Zhang and Yinfeng Xu and Xiaoping Wu",
year = "2008",
doi = "10.1007/978-3-540-68880-8\_31",
language = "英语",
isbn = "354068865X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "328--336",
booktitle = "Algorithmic Aspects in Information and Management - 4th International Conference, AAIM 2008, Proceedings",
note = "4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008 ; Conference date: 23-06-2008 Through 25-06-2008",
}