@inproceedings{abd52b2b27414ff291004e39261a4ab9,
title = "Semi-online hierarchical load balancing problem with bounded processing times",
abstract = "In this paper, we consider the online hierarchical scheduling problem on two parallel machines, with the objective of maximizing the minimum machine load. Since no competitive algorithm exists for this problem, we consider the semi-online version with bounded processing times, in which the processing times are bounded by an interval [1,α] where α ≥ 1. We prove that no algorithm can have a competitive ratio less than 1 + α and give an optimal algorithm with the competitive ratio of 1 + α. Moreover, if we further know the sum of jobs' processing time in advance, we prove that no algorithm can have a competitive ratio less than α where 1 ≤ α < 2, and we also propose an algorithm which is shown to be optimal for the case 1 ≤ α < 2.",
keywords = "Competitive ratio, Hierarchy, Load balancing, Scheduling, Semi-online",
author = "Taibo Luo and Yinfeng Xu",
year = "2014",
doi = "10.1007/978-3-319-07956-1\_21",
language = "英语",
isbn = "9783319079554",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "231--240",
booktitle = "Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings",
note = "10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014 ; Conference date: 08-07-2014 Through 11-07-2014",
}