Conflictless task scheduling using association rules

Abstract

The proposed rules of conflictless task scheduling is based on binary representation of tasks. Binary identifiers promote the process of rapid detection of conflicts between tasks. The article presents the concept of conflictless tasks scheduling using one of the data mining methods, namely association rules.