Neural computing: theory and practice
Neural computing: theory and practice
Introduction to algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming
Algorithm for synthesis of real-time systems under reliability constraints
Journal of Computer and Systems Sciences International
Programming and Computing Software
Scheduling algorithms for real-time computing systems admitting simulation models
Programming and Computing Software
Problems of instrumental support for the development of distributed embedded real-time systems
Programming and Computing Software
| Hi-index | 0.00 |
Data structures for direct and parametric representation of schedules are considered and corresponding systems of operations for correcting schedules are introduced. Those operations are used for designing iteration algorithms of schedule construction. It is proved that the direct and parametric representation of schedules and the corresponding correction operations allow the construction of iteration algorithms that ensure the transformation of an arbitrary schedule into an optimal one in a linear number of iteration steps relative to the number of scheduled tasks. Moreover, those algorithms ensure that schedules obtained at all iteration steps are feasible.