Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/441
DC FieldValueLanguage
dc.contributor.authorZhao, Yingchaoen_US
dc.contributor.otherFong, K. C. K.-
dc.contributor.otherLi, M.-
dc.contributor.otherLi, Y.-
dc.contributor.otherPoon, S.-H.-
dc.contributor.otherWu, W.-
dc.date.accessioned2021-03-27T09:04:39Z-
dc.date.available2021-03-27T09:04:39Z-
dc.date.issued2017-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/441-
dc.description.abstractWe study the following scheduling problem on a single processor. We are given <i>n</i> jobs, where each job j<sub>i</sub> has an integer release time r<sub>i</sub>, processing time p<sub>i</sub> as well as deadline d<sub>i</sub>. 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( n<sup>3</sup> ) dynamic programming algorithm for the case of agreeable deadlines with d<sub>i</sub> ≤ d<sub>j</sub> whenever r<sub>i</sub> < r<sub>j</sub> 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.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.titleScheduling tasks to minimize active time on a processor with unlimited capacityen_US
dc.typeconference proceedingsen_US
dc.relation.conference12th Workshop on Models and Algorithms for Planning and Scheduling Problems-
dc.relation.conference14th Annual Conference of the Theory and Applications of Models of Computation-
dc.relation.publicationTheory and Applications of Models of Computation (14th Annual Conference, TAMC 2017) Proceedingsen_US
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.isbn9783319559100en_US
dc.description.startpage247en_US
dc.description.endpage259en_US
dc.cihe.affiliatedYes-
item.languageiso639-1en-
item.openairetypeconference proceedings-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
crisitem.author.deptYam Pak Charitable Foundation School of Computing and Information Sciences-
crisitem.author.orcid0000-0001-8362-6735-
Appears in Collections:CIS Publication
Files in This Item:
File Description SizeFormat
Check Library Catalogue138 BHTMLView/Open
SFX Query Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.