Capacity scheduling for data services over digital networks

DOI10.1002/JOS.79MaRDI QIDQ5952429zbMATH OpenOpenAlexFDO

Authors W. F. J. Verhaegh

Publication date 27 July 2003

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jos.79

zbMATH Keywords

bi-linear programmingcolumn generationdata transmissionlocal searchresource-constrained project schedulingtime-resource trade-off

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Recommendations

• scientific article; zbMATH DE number 3900475
• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• Network capacity management under competition
• Capacity management in decentralized networks
• On the capacity assignment problem in packet-switching computer networks
• Robust capacity assignment in telecommunications
• Optimal resource capacity management for stochastic networks
• Capacity of Distributed Opportunistic Scheduling in Nonhomogeneous Networks

Cited in

(3)

• Spare capacity provisioning for quasi-static traffic
• Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition
• scientific article; zbMATH DE number 3900475 (Why is no real title available?)

This page was built for publication: Capacity scheduling for data services over digital networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952429)