Algorithm for optimal allocation of a continuous resource varying over time
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] pracownik
2014
referat
angielski
- scheduling
- continuous resource
- makespan
- optimization
- exact algorithm
EN 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.
824 - 827
WoS (15)