Scheduling transmissions in a network

DOI10.1016/0196-6774(85)90010-0zbMath0576.68021OpenAlexW2044687755MaRDI QIDQ3696506

Michael Rodeh, Alon Itai

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90010-0

zbMATH Keywords

optimum schedulefinite-capacity channelsmemoryless nodesmultisource single-sink network flow problemstationary schedule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Scheduling jobs to minimize total cost ⋮ On the computation of fast data transmissions in networks with capacities and delays ⋮ A solution to the random assignment problem on the full preference domain ⋮ Generalized max flows and augmenting paths

This page was built for publication: Scheduling transmissions in a network