scientific article; zbMATH DE number 3560745
From MaRDI portal
Publication:4131656
Cited in
(9)- Probabilistic single processor scheduling
- An optimal scheduling algorithm for preemptable real-time tasks
- Minimizing the stretch when scheduling flows of divisible requests
- Ideal schedules in parallel machine settings
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- Simple algorithms for multiprocessor scheduling to meet deadlines
- On the complexity of generalized due date scheduling problems
- Deadline scheduling of tasks with ready times and resource constraints
- Minimal schedulability interval for real-time systems of periodic tasks with offsets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131656)
