Optimal Size-Aware Dispatching Rules via Value Iteration and Some Numerical Investigations
<|reference_start|>Optimal Size-Aware Dispatching Rules via Value Iteration and Some Numerical Investigations: 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.<|reference_end|>
@article{hyytiä2024optimal,
    title={Optimal Size-Aware Dispatching Rules via Value Iteration and Some
  Numerical Investigations},
    author={Esa Hyyti"a and Rhonda Righter},
    journal={arXiv preprint arXiv:2402.08142},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.08142},
    primaryClass={math.OC cs.PF}
}