Mixture of two different scheduling policies in a class of discrete event systems

This research develops a scheduling framework for a class of discrete event systems. We use max-plus algebra for formulating the constraints of target systems. Two types of scheduling policies can coexist within a single job in the framework. One policy focuses on cases whose precedence relations of tasks can be represented by a directed acyclic graph, whilst the other policy the relative start and completion times can be represented by a strongly connected graph. These two policies have been handled in different frameworks heretofore, and this research thus aims to unify these without introducing a new construct for specifying required parameters.