Scheduling UET-UCT outforests to minimize maximum lateness

DOI10.1016/J.EJOR.2004.04.016zbMath1066.90040OpenAlexW2057817357MaRDI QIDQ1772849

Gaurav Singh

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.016

zbMATH Keywords

SchedulingPrecedence constraintsMaximum latenessUnit communication delaysUnit execution times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• UET scheduling with unit interprocessor communication delays
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Three, four, five, six, or the complexity of scheduling with communication delays
• Scheduling UET-UCT series-parallel graphs on two processors
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• The Complexity of Scheduling Trees with Communication Delays
• Performance of critical path type algorithms for scheduling on parallel processors

This page was built for publication: Scheduling UET-UCT outforests to minimize maximum lateness