Scheduling real-time computations with separation constraints

DOI10.1016/0020-0190(92)90091-9zbMath0768.68005OpenAlexW2000197176MaRDI QIDQ1198025

Kwei-Jay Lin, Ching-Chih Han

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90091-9

zbMATH Keywords

schedulingpolynomial time algorithmreal-time systemstreesforestseparation problemdirected forestminimum distance constraints

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Related Items (5)

A zero-space algorithm for negative cost cycle detection in networks ⋮ A polynomial time algorithm for Zero-Clairvoyant scheduling ⋮ An empirical analysis of algorithms for partially Clairvoyant scheduling ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls

Cites Work

• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• On Some Variants of the Bandwidth Minimization Problem

This page was built for publication: Scheduling real-time computations with separation constraints