Scheduling by Timed Automata under Resource Conflicts

Considering time and resource limitations in different industries, increases importance and complexity of task scheduling problems where all tasks should be executed in the minimum time. Moreover, integrating uncontrollable tasks in the procedure makes more complexity in this problems. The main objective of our work is to propose a formal model and a tool for automatic scheduling of a system with a specific kind of resource conflict in order to minimize system's makespan as much as possible.