Quick Recovery to Alternative ELSP Schedules
Posted: 8 Oct 2012
Date Written: November 1, 2011
We consider a production system where multiple items are produced on a single machine. We study the problem of how to quickly and cheaply recover to an optimal ELSP schedule following a shock that causes the inventory levels to deviate arbitrarily from their optimal paths. We focus on a rotation production schedule where each item is produced once per cycle. Recognizing that the recovery and recovered production sequences may differ from the original ELSP schedule allows us more flexibility to achieve a lower recovery cost. The five heuristics we develop reduce costs (by as much as 90%) in most scenarios, as compared to the existing algorithms. They are especially efficient when the percentage of the idle time in the ELSP schedule is high, the number of items produced is large, the shock happens to an item in the later position of the sequence, the magnitude of the shock is relatively moderate, the backorder cost is very high or very low and, the machine utilization is low.
Suggested Citation: Suggested Citation