Scheduling time-constrained communication in linear networks

DOI10.1007/s00224-002-1001-6zbMath1012.68024OpenAlexW2124548639MaRDI QIDQ1871771

Walter Unger, Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg

Publication date: 4 May 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-002-1001-6

zbMATH Keywords

bufferless scheduling algorithm

Mathematics Subject Classification ID

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

Related Items (9)

Direct routing: Algorithms and complexity ⋮ Online packet-routing in grids with bounded buffers ⋮ Online time-constrained scheduling in linear and ring networks ⋮ Unnamed Item ⋮ Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization ⋮ Scheduling problems in transportation networks of line topology ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Approximation algorithms for time-constrained scheduling on line networks ⋮ Scheduling parallel batching machines in a sequence

This page was built for publication: Scheduling time-constrained communication in linear networks