Journal article
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
Acta cybernetica (Szeged), Vol.18(2), pp.239-255
01 Jan 2007
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.
Metrics
3 Record Views
Details
- Title
- Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
- Creators
- David Hanak - Budapest Univ Technol & Econ BME SZIT, Dept Comp Sci & Informat Theory, Budapest, HungaryNagarajan Kandasamy - Drexel University
- Publication Details
- Acta cybernetica (Szeged), Vol.18(2), pp.239-255
- Publisher
- Univ Szeged, Fac Science
- Number of pages
- 17
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Identifiers
- 991019170613504721
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Computer Science, Cybernetics