Abstract
Scheduling is a crucial task in behavioural synthesis and aNp-hard optimisation problem. Neural net computationparadigms bring potential for efficient solutions to suchproblems. This paper presents a new scheduling algorithmbased on Kohonen’s rule for self organisation. The algorithmhas an inherent hill climbing mechanism, copeswith a comprehensive set of constraints and can be implementedon massively parallel structures. Its performanceon well known benchmark examples, presented in the paper,is on par with the best reported.
Keywords
Computer scienceScheduling (production processes)Benchmark (surveying)ComputationArtificial neural networkArtificial intelligenceJob shop schedulingMassively parallelTask (project management)AlgorithmParallel computingMathematical optimizationMathematicsScheduleEngineering
Affiliated Institutions
Related Publications
A new optimizer using particle swarm theory
The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently develope...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 136-140
- Citations
- 16
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
16
OpenAlex
0
Influential
15
CrossRef
Cite This
A. Hemani,
A. Postula
(2002).
A neural net based self organising scheduling algorithm.
Proceedings of the European Design Automation Conference, 1990., EDAC.
, 136-140.
https://doi.org/10.1109/edac.1990.136634
Identifiers
- DOI
- 10.1109/edac.1990.136634