Skip to main navigation
Skip to search
Skip to main content
Teesside University's Research Portal Home
Home
Profiles
Research units
TeesRep
Student theses
Projects
Datasets
Press/Media
Search by expertise, name or affiliation
Exact and heuristic algorithms for thrift cyclic scheduling
Michael J. Short
SCEDT Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Exact and heuristic algorithms for thrift cyclic scheduling'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Heuristic Algorithms
100%
Thrift
100%
Exact Algorithm
100%
Cyclic Scheduling
100%
Task Set
66%
Scheduler
66%
Embedded Systems
66%
Offset Assignment
66%
Assignment Problem
66%
Popular
33%
Non-preemptive
33%
Periodic Tasks
33%
Non-preemptive Scheduling
33%
Clock Frequency
33%
Real-time Systems
33%
Execution Time
33%
Solution Verification
33%
Computational Difficulty
33%
Flexible Implementation
33%
Pseudo-polynomial
33%
Polynomial Complexity
33%
Implementation Model
33%
Compact Implementation
33%
Cyclic Executive
33%
Computer Science
Embedded Systems
100%
Heuristic Algorithm
100%
Exact Algorithm
100%
Assignment Problem
100%
Cyclic Scheduling
100%
Application Area
50%
Candidate Solution
50%
Speed-up
50%
Real Time Systems
50%
Polynomial Complexity
50%
Implementation Model
50%
Execution Time
50%
Cyclic-Executive
50%