Understand how to optimize complex queue networks under heavy load.
This book presents a practical framework for dynamically releasing jobs and setting service priorities in a multistation, multiclass network. It translates a difficult scheduling problem into a Brownian control problem and provides a numerical approach to find effective policies.
These pages explain how to model input control and sequencing decisions, derive policies from workload analysis, and interpret the results for real systems. The methods balance long-run costs with throughput requirements, using linear programs and finite-difference approximations to reach actionable strategies.
- Learn how to formulate the workload, control, and sequencing problems for networks with general service times and routing.
- See how to compute dynamic priority rules that minimize holding costs while meeting throughput targets.
- Discover a practical numerical approach to approximate constrained control problems when closed-form solutions are hard to obtain.
- Explore a concrete example that compares the proposed policies to conventional rules and demonstrates tangible performance gains.
Ideal for readers seeking a rigorous yet applicable guide to scheduling in complex service networks, with clear connections between theory and implementation.