Optimal dynamic scheduling in Jackson networks

DOI10.1109/9.8648zbMath0674.90024OpenAlexW2087491016MaRDI QIDQ3829323

David D. W. Yao, Keith W. Ross

Publication date: 1989

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.8648

zbMATH Keywords

Conservation lawspolymatroidinteractive trafficinternal routingJackson-like networkpacket-switched data networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (6)

Simultaneous optimization of flow control and scheduling in a single server queue with two job classes ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Performance evaluation of scheduling control of queueing networks: Fluid model heuristics ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Optimal intensity control of a multi-class queue

This page was built for publication: Optimal dynamic scheduling in Jackson networks