Scheduling UET-UCT tasks: Branch-and-bound search in the priority space

DOI10.1007/S11081-009-9080-8MaRDI QIDQ622602zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

maximum latenessparallel processorspartially ordered tasksrelease timesschedulingunit communication delay

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 784432
• Scheduling UET task systems with concurrency on two parallel identical processors
• Scheduling multiprocessor UET tasks of two sizes
• UET scheduling with unit interprocessor communication delays
• Scheduling UET-UCT outforests to minimize maximum lateness

Cites work

• 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
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• 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

(8)

• Scheduling multiprocessor UET tasks of two sizes
• UET scheduling with unit interprocessor communication delays
• UET-scheduling with constrained processor allocations
• Scheduling UET-UCT outforests to minimize maximum lateness
• Minimizing total completion time for UET tasks with release time and outtree precedence constraints
• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
• A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
• An improved discrete optimisation procedure with comparison to constraint programming

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)