The computing load for the control of a steel rolling mill plant may be regarded as a group of tasks (each task is an individual program) such as setting of controlled variables and operation monitoring. The task group can be represented by a task graph, an acyclic finite directed graph because precedence relations exist among the tasks. Dynamic scheduling methods are proposed which are extensions of the developed static scheduling algorithms. Their efficiency in comparison with the deadline driven scheduling algorithm developed by Liu and others is shown.
|Number of pages||11|
|Journal||Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)|
|Publication status||Published - 1987 Mar|
ASJC Scopus subject areas
- Electrical and Electronic Engineering