Article ID: | iaor2003100 |
Country: | United States |
Volume: | 49 |
Issue: | 3 |
Start Page Number: | 275 |
End Page Number: | 287 |
Publication Date: | Apr 2002 |
Journal: | Naval Research Logistics |
Authors: | Chand Suresh, McClurg Tim |
Keywords: | programming: dynamic |
This paper considers a finite horizon parallel machine replacement problem where a fixed number of machines is in operation at all times. The operating cost for a machine goes up as the machine gets older. An older machine may have to be replaced by a new one when its operating cost becomes too high. There is a fixed order cost associated with the purchase of new machines. Machine purchase prices and salvage values may depend on the period in which they were purchased. The objective is to find a replacement plan that minimizes the total discounted cost over the problem horizon. We believe that the costs in our model are more commonly observed in practice than those previously used in the literature. The paper develops properties of optimal solutions and an efficient forward-time algorithm to find an optimal replacement plan. A dominance property is developed that further limits the options to be considered, and a simple forecast horizon result is also presented. Future research possibilities are mentioned.