Scheduling multiple streams with (m, k)-firm deadlines having different importance over Markovian channels.
Andreas WilligPublished in: ETFA (2005)
Keyphrases
- scheduling algorithm
- scheduling problem
- response time
- round robin
- information technology
- timing constraints
- multi channel
- learning algorithm
- search engine
- preventive maintenance
- dynamic scheduling
- resource allocation
- manufacturing cell
- parallel machines
- resource constraints
- data sets
- special case
- case study
- neural network