DocumentCode
154443
Title
Algorithm for optimal allocation of a continuous resource varying over time
Author
Mika, Marek ; Rozycki, Rafal ; Waligora, Grzegorz
Author_Institution
Inst. of Comput. Sci., Poznan Univ. of Technol., Poznan, Poland
fYear
2014
fDate
2-5 Sept. 2014
Firstpage
824
Lastpage
827
Abstract
In this paper a problem of scheduling preemptable, independent jobs requiring a continuous, renewable resource to minimize the makespan is considered. The available amount of the continuous resource varies over time. Processing speed of a job is an increasing and convex function of the amount of the resource allotted to the job at a time. An exact algorithm for finding an optimal schedule is proposed.
Keywords
minimisation; resource allocation; scheduling; independent job scheduling; makespan minimization; optimal continuous resource allocation; preemptable job scheduling; renewable resource; Availability; Convex functions; Optimal scheduling; Processor scheduling; Program processors; Resource management; Schedules; continuous resource; exact algorithm; makespan; optimization; scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Methods and Models in Automation and Robotics (MMAR), 2014 19th International Conference On
Conference_Location
Miedzyzdroje
Print_ISBN
978-1-4799-5082-9
Type
conf
DOI
10.1109/MMAR.2014.6957463
Filename
6957463
Link To Document