Please use this identifier to cite or link to this item:
|Title:||Scheduling tasks to minimize active time on a processor with unlimited capacity||Author(s):||Zhao, Yingchao||Author(s):||Fong, K. C. K.
|Issue Date:||2017||Publisher:||Springer||Related Publication(s):||Theory and Applications of Models of Computation (14th Annual Conference, TAMC 2017) Proceedings||Start page:||247||End page:||259||Conference:||12th Workshop on Models and Algorithms for Planning and Scheduling Problems
14th Annual Conference of the Theory and Applications of Models of Computation
We study the following scheduling problem on a single processor. We are given n jobs, where each job ji has an integer release time ri, processing time pi as well as deadline di. The processor can schedule an unlimited number of jobs at any time t. Our objective is to schedule the jobs together such that the total number of active time slots is minimized. We present an O( n3 ) dynamic programming algorithm for the case of agreeable deadlines with di ≤ dj whenever ri < rj or all jobs are big. In the general case, we present an online algorithm with competitive ratio 4 and show that our analysis is tight.
|URI:||https://repository.cihe.edu.hk/jspui/handle/cihe/441||CIHE Affiliated Publication:||Yes|
|Appears in Collections:||CIS Publication|
Show full item record
Files in This Item:
|Check Library Catalogue||138 B||HTML||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.