Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
From MaRDI portal
Publication:622602
Recommendations
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- An iterative algorithm for scheduling UET tasks with due dates and release times.
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- UET scheduling with unit interprocessor communication delays
Cited in
(7)- The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- Scheduling UET-UCT outforests to minimize maximum lateness
- Scheduling multiprocessor UET tasks of two sizes
- UET-scheduling with constrained processor allocations
- UET scheduling with unit interprocessor communication delays
- A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
This page was built for publication: Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622602)