OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS

DOI10.1142/S0129054195000111zbMath0830.68008OpenAlexW2114689831MaRDI QIDQ4853335

Miriam Di Ianni, Andrea E. F. Clementi

Publication date: 28 January 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054195000111

zbMATH Keywords

NP-completenessscheduling problemoptimal time strategy

Mathematics Subject Classification ID

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

Related Items (2)

Scheduling trains with small stretch on a unidirectional line ⋮ Train Scheduling on a Unidirectional Path

This page was built for publication: OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS