TY - GEN
T1 - Active and Busy Time Scheduling Problem
T2 - International Workshop on Complexity and Approximation 2019
AU - Chau, Vincent
AU - Li, Minming
N1 - Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).
PY - 2019/4
Y1 - 2019/4
N2 - 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.
AB - 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.
KW - Active time
KW - Approximation
KW - Busy time
UR - http://www.scopus.com/inward/record.url?scp=85081129169&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85081129169&origin=recordpage
U2 - 10.1007/978-3-030-41672-0_13
DO - 10.1007/978-3-030-41672-0_13
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783030416713
T3 - Lecture Notes in Computer Science
SP - 219
EP - 229
BT - Complexity and Approximation - In Memory of Ker-I Ko
A2 - Du, Ding-Zhu
A2 - Wang, Jie
PB - Springer
Y2 - 27 April 2019 through 28 April 2019
ER -