Multi-resource sharing scheduling considering uncontrollable environment

This paper addresses the problem of scheduling through a visual, expressive and formal modeling approach, based on Timed Game Automata (TGA). The originality of the proposed approach lies in integrating various kinds of uncontrollability in the scheduling problem and also the ability of handling the sharing of multiple resources. This uncontrollable behaviors consist of the start time, the duration of the task and the failure occurrence in a schedule which are modeled by TGA. The models have the advantage of being directly exploitable by means of synthesis tools. To obtain the minimum makespan and optimal schedules as the result, a time-optimal reachability game is performed through Tiga tool. The obtained result for a scheduling example shows the huge difference in the obtained schedule with and without considering uncontrollable behaviors.