Sign in
Back
Scheduling UECT trees with Communication Delays on Two Processors with Unavailabilities
Conference proceeding   Open access

Scheduling UECT trees with Communication Delays on Two Processors with Unavailabilities

Khaoula Ben Abdellafon, Eric Sanlaville, Amine Mahjoub and Ouajdi Korbaa
IFAC PAPERSONLINE, Vol.48(3), pp.1790-1795
01/01/2015
DOI: https://doi.org/10.1016/j.ifacol.2015.06.346

Abstract

Automation & Control Systems Science & Technology Technology
In this paper a new polynomial scheduling algorithm is preselited. It is used for scheduling lint Execution and Conan uniication Time (UFCT) iittrees on two identical processors where one of these is subject to periods of unavailabilities. The optimality criterion is the makespan. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
url
https://doi.org/10.1016/j.ifacol.2015.06.346View
Published (Version of record) Open

Metrics

1 Record Views

Details