Active and Busy Time Scheduling Problem : A Survey

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)

View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationComplexity and Approximation - In Memory of Ker-I Ko
EditorsDing-Zhu Du, Jie Wang
PublisherSpringer
Pages219-229
ISBN (Electronic)9783030416720
ISBN (Print)9783030416713
Publication statusPublished - Apr 2019

Publication series

NameLecture Notes in Computer Science
Volume12000
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

TitleInternational Workshop on Complexity and Approximation 2019
PlaceChina
CityQingdao
Period27 - 28 April 2019

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.

Research Area(s)

  • Active time, Approximation, Busy time

Bibliographic Note

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).

Citation Format(s)

Active and Busy Time Scheduling Problem : A Survey. / Chau, Vincent; Li, Minming.

Complexity and Approximation - In Memory of Ker-I Ko. ed. / Ding-Zhu Du; Jie Wang. Springer, 2019. p. 219-229 (Lecture Notes in Computer Science; Vol. 12000).

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)