Synthesising robust schedules for minimum disruption repair using linear programming

Hanák Dávid and Kandasamy Nagarajan: Synthesising robust schedules for minimum disruption repair using linear programming. In: Acta cybernetica, (18) 2. pp. 239-255. (2007)

[thumbnail of Hanak_2007_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (266kB) | Preview


An off-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. This schedule must, however, be executed in a dynamic and unpredictable operating environment where resources may fail and tasks may execute longer than expected. To accommodate such execution uncertainties, this paper addresses the synthesis of robust task schedules using a slack-based approach and proposes a solution using integer linear programming (ILP). Earlier we formulated a time slot based ILP model whose solutions maximise the temporal flexibility of the overall task schedule. In this paper, we propose an improved, interval based model, compare it to the former, and evaluate both on a set of random scenarios using two public domain ILP solvers and a proprietary SAT/ILP mixed solver.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2007
Volume: 18
Number: 2
ISSN: 0324-721X
Page Range: pp. 239-255
Language: English
Place of Publication: Szeged
Event Title: Symposium of Young Scientists on Intelligent Systems (1.) (2006) (Budapest)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 253-255. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 16. 13:29

Actions (login required)

View Item View Item