{'fraction_non_alphanumeric': 0.013756613756613757, 'fraction_numerical': 0.0, 'mean_word_length': 5.183006535947713, '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}}
Inventory decisions for an assemble-to-order system with two ordering opportunities and multiple transportation modes

We consider inventory decision for an assemble-to-order system with two ordering opportunities and a one-time uncertain demand. The manufacturer can place her first order of the components ahead of demand realization with relatively lower prices. The second emergent order can be placed with relatively higher prices after demand is realized in case of component shortages. There are a number of lead times for each component representing different transportation modes for the second order. The manufacturer has to choose the one that best balance the time and cost tradeoff. We formulate the problem as a stochastic programming problem. We further consider a simpler version with a single component and multiple lead times. We propose several structural properties and a decompose algorithm to solve the problem efficiently.