Synthesising robust schedules for minimum disruption repair using linear programming
AbstractAn 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.
Download data is not yet available.
How to Cite
Hanák, D., & Kandasamy, N. (2007). Synthesising robust schedules for minimum disruption repair using linear programming. Acta Cybernetica, 18(2), 239-255. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3716