A single machine replacement model with learning

A single machine replacement model with learning

0.00 Avg rating0 Votes
Article ID: iaor19931712
Country: United States
Volume: 40
Issue: 2
Start Page Number: 175
End Page Number: 192
Publication Date: Mar 1993
Journal: Naval Research Logistics
Authors:
Keywords: programming: dynamic
Abstract:

The replacement or upgrade of productive resources over time is an important decision for a manufacturing organization. The type of technology used in the productive resources determines how effectively the manufacturing operations can support the product and marketing strategy of the organization. Increasing operating costs (cost of maintenance, labor, and depreciation) over time force manufacturing organizations to periodically consider replacement or upgrade of their existing productive resources. The paper assumes that there is a setup cost associated with the replacement of a machine, and that the setup cost is a nonincreasing function of the number of replacements made so far due to learning in setups. The operating cost of a newer machine is assumed to be lower than the operating cost of an older machine in any given period, except perhaps in the first period of operation of the new machine when the cost could be unusually high due to higher initial depreciation. A forward dynamic programming algorithm is developed which can be used to solve finite-horizon problems. The paper develops procedures to find decision and forecast horizons such that choices made during the decision horizon based only on information over the forecast horizon are also optimal for any longer horizon problem. Thus, it is able to obtain optimal results for what is effectively an infinite-horizon problem while only requiring data over a finite period of time. The paper presents a numerical example to illustrate the decision/forecast horizon procedure, as well as a study of the effects of considering learning in making a series of machine replacement decisions.

Reviews

Required fields are marked *. Your email address will not be published.