A neural net based self organising scheduling algorithm

Scheduling is a crucial task in behavioural synthesis and a NP-hard optimisation problem. Neural net computation paradigms bring potential for efficient solutions to such problems. This paper presents a new scheduling algorithm based on Kohonen's rule for self organisation. The algorithm has an inherent hill climbing mechanism, copes with a comprehensive set of constraints and can be implemented on massively parallel structures. Its performance on well known benchmark examples, presented in the paper, is on par with the best reported.<
>