{'fraction_non_alphanumeric': 0.013929618768328446, 'fraction_numerical': 0.0, 'mean_word_length': 5.408450704225352, '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}}
Optimal and Approximate Policies for Inventory Systems with Order Crossover

A common assumption in inventory analysis is that replenishment orders arrive in the same sequence in which they were placed. In practice, however, a variety of factors may cause orders to arrive out of sequence, a phenomenon known as order crossover. This paper analyzes a periodic review inventory system for a single item with discrete variable demand and discrete variable and long lead-times (relative to the review period). Under such a scenario, multiple orders are simultaneously outstanding, and orders may arrive in a different sequence than placed. If such order crossover occurs, traditional inventory analysis overstates expected shortages and standard inventory control policies are no longer optimal. This paper discusses why orders may cross over in practice and investigates the implications of order crossover to inventory management policies. We investigate the cost performance of optimal policies under order crossover and also suggest approximate policies which are easier to compute and implement. Both the optimal and approximate policies take advantage of detailed real-time information about the status of pending orders and goods in transit, and hence in a majority of cases perform better than commonly used policies which do not incorporate such information.