The complexity of multidimensional periodic scheduling

DOI10.1016/S0166-218X(98)00112-7zbMath0921.90099OpenAlexW1981238054MaRDI QIDQ1281399

A. van der Werf, P. E. R. Lippens, Emile H. L. Aarts, Wim F. J. Verhaegh, Jef L. van Meerbergen

Publication date: 5 October 1999

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00112-7

zbMATH Keywords

NP-harddesign of high-performance video signal processorsmultidimensional periodic scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Efficient scheduling of periodic information monitoring requests ⋮ The complexity of multidimensional periodic scheduling

Uses Software

• Sehwa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for knapsack with divisible item sizes
• Bin packing with divisible item sizes
• A survey of priority rule-based scheduling
• Dataflow analysis of array and scalar references
• The complexity of multidimensional periodic scheduling
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Data path synthesis

This page was built for publication: The complexity of multidimensional periodic scheduling