Extension 2 (continued)

• The state vector at time t under policy p contains the pair of (potential revenue, service rate) of each request i currently in the system at time t.
• The best job is the request with the highest expected revenue per remaining service time, which can be found by multiplying the potential revenue by the service rate.
• Optimal policy: Serve the request with the highest c_i mu_i product

Previous slide

Next slide

Back to first slide

View graphic version