Skip to Main content Skip to Navigation

Formal approaches to multi-resource sharing scheduling

Abstract : The objective of scheduling problems is to find the optimal performing sequence for a set of tasks by respecting predefined constraints and optimizing a cost: time, energy, etc. Despite classical approaches, automata models are expressive and also robust against changes in the parameter setting and against changes in the problem specification. Besides, few studies have used formal verification approaches for addressing scheduling problems; yet none of them considered challenging and practical issues such as multi-resource sharing aspect, uncontrollable environment and reaching the optimal schedule in a reasonable time for industrializing the model. The main objective of this thesis is to propose an efficient modeling and solving approach for the scheduling problem, considering multi-resource sharing and potential uncertainty in occurrence of certain events. For this purpose, after an introduction in Chapter 1, Chapter 2 addresses the problem of scheduling through a visual, expressive and formal modeling approach, based on weighted automata and the theory of timed automata. The originality of the proposed approach lies in ability of handling the sharing of multiple resources and proposing an efficient solving approach. The proposed models have the advantage of being directly exploitable by means of formal verification tools. The results are obtained using the UPPAAL tool. To solve the problem, an algorithm is developed based on iterating reachability analysis to obtain sub-optimal makespan. Results show the proposed model and solving approach provides a very promising complexity on the class of studied problems and can be applied to industrial cases. In Chapter 3, a synchronous composition of weighted automata is proposed to solve the scheduling problem by performing an optimal reachability analysis directly on the weighted automata models. In the fourth chapter, various uncontrollable behaviors such as the start time, the duration of the task and the failure occurrence in a scheduling problem are modeled by timed game automata. Then, the problem is solved by performing an optimal strategy synthesis over time in TIGA as a synthesis tool.
Document type :
Complete list of metadatas
Contributor : Abes Star :  Contact
Submitted on : Thursday, March 14, 2019 - 12:15:16 PM
Last modification on : Tuesday, January 5, 2021 - 12:32:03 PM
Long-term archiving on: : Saturday, June 15, 2019 - 7:19:16 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02067680, version 1


Mahya Rahimi. Formal approaches to multi-resource sharing scheduling. Automatic. Université de Lyon, 2017. English. ⟨NNT : 2017LYSEI129⟩. ⟨tel-02067680⟩



Record views


Files downloads