{'fraction_non_alphanumeric': 0.01828410689170183, 'fraction_numerical': 0.0, 'mean_word_length': 4.5625, '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}}
Dispatching from Depot Repair in a Recoverable Item Inventory System: On the Optimality of a Heuristic Rule

This paper examines real-time decision rules for a U.S. Air Force inventory system where items are repaired rather than “used up.” The problem is to decide which user in the system has the greatest need for the newly available inventory items coming out of repair. 
 
The system is modeled as a Markov decision process and a heuristic rule is presented. This rule, the Transportation Time Look Ahead policy, is justified theoretically by showing that the rule is optimal for a modified model. Thus we have a theoretical justification of a decision rule in a large scale dynamic programming application.