@inproceedings{692308dc647e4bd68a7179d0a4f14efe,
title = "Active and busy time scheduling problem: A survey",
abstract = "We present an overview of recent research on the busy time and active time scheduling model, which has its applications in energy efficient scheduling for cloud computing systems, optical network design and computer memories. The major feature of this type of scheduling problems is to aggregate job execution into as few time slots as possible to save energy. The difference between busy time and active time is that the former refers to multiple machines while the latter refers to a single machine. After summarizing the previous results on this topic, we propose a few potential future directions for each model.",
keywords = "Active time, Approximation, Busy time",
author = "Vincent Chau and Minming Li",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.; International Workshop on Complexity and Approximation, 2019 ; Conference date: 27-04-2019 Through 28-04-2019",
year = "2020",
doi = "10.1007/978-3-030-41672-0\_13",
language = "英语",
isbn = "9783030416713",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "219--229",
editor = "Ding-Zhu Du and Jie Wang",
booktitle = "Complexity and Approximation - In Memory of Ker-I Ko",
address = "美国",
}