Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
From MaRDI portal
Publication:622602
DOI10.1007/S11081-009-9080-8zbMATH Open1239.90055OpenAlexW2022544404MaRDI QIDQ622602FDOQ622602
Authors: Yakov Zinder, Bo Su, Gaurav Singh, Ron Sorli 
Publication date: 3 February 2011
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-009-9080-8
Recommendations
maximum latenessschedulingrelease timesparallel processorspartially ordered tasksunit communication delay
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- UET scheduling with unit interprocessor communication delays
- Title not available (Why is that?)
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- An iterative algorithm for scheduling UET tasks with due dates and release times.
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)
