Synthesising robust schedules for minimum disruption repair using linear programming

Authors:
Dávid Hanák;Nagarajan Kandasamy
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics (BME SZIT), Hungary and Computer and Automation Research Institute of the Hungarian Academy o ...;Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA
Venue:
Acta Cybernetica
Year:
2007

Citing 6
Cited 0

Just-in-case scheduling

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Deadline Assignment in a Distributed Soft Real-Time System

IEEE Transactions on Parallel and Distributed Systems
Interval selection: applications, algorithms, and lower bounds

Journal of Algorithms
Generic ILP versus specialized 0-1 ILP: an update

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Scheduling Algorithms

Scheduling Algorithms
Enhancing a search algorithm to perform intelligent backtracking

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.