Optimal Size-Aware Dispatching Rules via Value Iteration and Some Numerical Investigations

TL;DR

This paper presents a numerical approach using value iteration to determine optimal size-aware dispatching policies and provides numerical insights into their characteristics.

Contribution

It introduces a method for computing optimal size-aware dispatching rules and offers numerical analysis to understand their properties.

Findings

Optimal policies can be computed numerically using value iteration.

Numerical examples reveal key features of the optimal size-aware dispatching policies.

The approach enhances understanding of size-aware dispatching in dynamic systems.

Abstract

This technical report explains how optimal size-aware dispatching policies can be determined numerically using value iteration. It also contains some numerical examples that shed light to the nature of the optimal policies itself. The report complements our ``Towards the Optimal Dynamic Size-aware Dispatching'' article that will appear in Elsevier's Performance Evaluation in 2024.