Algorithm for optimal allocation of a continuous resource varying over time

Marek Mika; Rafał Różycki; Grzegorz Waligóra

doi:10.1109/MMAR.2014.6957463

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Publications / Algorithm for optimal allocation of a continuous resource varying over time

Submit a comment

Chapter

Download BibTeX

Title

Algorithm for optimal allocation of a continuous resource varying over time

Authors

Marek Mika (WI) ^{[ 1 ][ P ]}
Rafał Różycki (WI) ^{[ 1 ][ P ]}
Grzegorz Waligóra (WI) ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | ^{[ P ]} employee

Year of publication

2014

Chapter type

paper

Publication language

english

Keywords

EN

scheduling
continuous resource
makespan
optimization
exact algorithm

Abstract

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.

Pages (from - to)

824 - 827

DOI

10.1109/MMAR.2014.6957463

URL

https://ieeexplore.ieee.org/document/6957463

Book

19th International Conference on Methods and Models in Automation and Robotics (MMAR 2014), Miedzyzdroje, 2-5 Sept. 2014

Presented on

19th International Conference on Methods and Models in Automation and Robotics, MMAR 2014, 2-5.09.2014, Międzyzdroje, Poland

Publication indexed in

WoS (15)

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS