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

DOI10.1007/S11081-009-9080-8zbMath1239.90055OpenAlexW2022544404MaRDI QIDQ622602

Ron Sorli, Bo Su, Yakov Zinder, Gaurav Singh

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

schedulingrelease timesparallel processorsmaximum latenesspartially ordered tasksunit communication delay

Mathematics Subject Classification ID

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

Related Items (1)

A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays

Cites Work

• Unnamed Item
• Unnamed Item
• UET scheduling with unit interprocessor communication delays
• 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.
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Scheduling UET-UCT tasks: Branch-and-bound search in the priority space