Scheduling unitary task systems with zero--one communication delays for quasi-interval orders

DOI10.1016/S0166-218X(02)00247-0zbMath1025.68009MaRDI QIDQ1811068

Aziz Moukrim

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

intervalordersseries-parallel orderslist scheduling algorithmsquasi-interval ordersscheduling with communication delays

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ A polynomial algorithm for recognizing the \(\mathcal A\)-order class

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• Multiprocessor scheduling with communication delays
• UET scheduling with unit interprocessor communication delays
• Scheduling series-parallel orders subject to 0/1-communication delays
• Optimal scheduling on parallel machines for a new order class
• Scheduling UET-UCT series-parallel graphs on two processors
• New complexity results on scheduling with small communication delays
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Interval-Ordered Tasks
• The Recognition of Series Parallel Digraphs
• The Complexity of Scheduling Trees with Communication Delays