Article ID: | iaor20011719 |
Country: | United Kingdom |
Volume: | 27 |
Issue: | 13 |
Start Page Number: | 1325 |
End Page Number: | 1345 |
Publication Date: | Nov 2000 |
Journal: | Computers and Operations Research |
Authors: | Nagi Rakesh, Rump Christopher M., Kazan Osman |
Keywords: | scheduling, heuristics, programming: integer |
Previously scheduled production plans frequently need to be updated because of demand uncertainty. After making a comprehensive definition of nervousness which includes costs for changes in production schedule and quantity, we suggest three methodologies. Two methods are modified versions of very well-known methods: the Wagner–Whitin algorithm and the Silver–Meal heuristic. However, our definition of nervousness and its consequences for altering predetermined production volumes make the well-known property of producing either zero or a sum of several periods' demand suboptimal. Therefore a third method, a new mixed integer linear programming formulation, is proposed which is shown to be more effective in some cases. Numerical analyses are carried out for a wide range of possible cases, through which we provide insights to the most appropriate algorithm in a parameterized space.