{'fraction_non_alphanumeric': 0.022636484687083888, 'fraction_numerical': 0.0, 'mean_word_length': 5.214876033057851, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Revisiting the optimality of the cμ-rule with Stochastic Flow Models

We revisit, in the context of Stochastic Flow Models (SFMs), a classic scheduling problem for optimally allocating a resource to multiple competing users. For the two-user case, we establish the optimality of the well-known cμ-rule for arbitrary stochastic processes using calculus of variations arguments as well as an Infinitesimal Perturbation Analysis (IPA) approach. The latter allows us to derive an explicit sensitivity estimate of the cost function with respect to a controllable parameter and to further study the problem when the cost function is nonlinear, deriving simple distribution-free cost sensitivity estimates and analyzing why the cμ-rule may fail in this case.