{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/37799"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/37799","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"A systems approach to replacement","abstract":"The object of this study is a new approach to the problem of replacement of assets which deteriorate and become obsolete with time. The investigator views replacement theory as a subset of capital budgeting. Capital budgeting has received much more attention, has benefited from many advances in mathematical programming techniques, and in general has been advanced to a much more sophisticated state of the art than has replacement theory. The approach taken in this work is to point out this divergence in advances in these areas by surveying the literature in each. Next a new approach to the replacement problem is presented. This approach is new in that it attacks the replacement problem as a system of interacting components rather than take the normal replacement approach to a single machine. The production process is modeled as a network in which each machine is represented by an arc. A single machine or two or more machines in parallel compose a stage of the process. Several stages are combined to complete the network. The general model is formulated as a mixed zero-one programming problem for a finite planning horizon. This model can be further modified by adding specialized constraints to make it fit more specific cases. The general model has provisions for equivalence relationships to carry funds forward or backward through time. It also takes into account such items as process requirements and machine capacities. Difficulties are encountered in that a normal problem is too large to solve. Further study reveals that by making a conservative assumption of using a single interest rate the problem can be reduced to a much smaller zero-one programming problem. This formulation for a reasonably sized production process is small enough to be solved by zero-one algorithms available in the literature. An example problem is formulated for illustrative purposes.","abstract_html":"The object of this study is a new approach to the problem of replacement of assets which deteriorate and become obsolete with time. The investigator views replacement theory as a subset of capital budgeting. Capital budgeting has received much more attention, has benefited from many advances in mathematical programming techniques, and in general has been advanced to a much more sophisticated state of the art than has replacement theory. The approach taken in this work is to point out this divergence in advances in these areas by surveying the literature in each. Next a new approach to the replacement problem is presented. This approach is new in that it attacks the replacement problem as a system of interacting components rather than take the normal replacement approach to a single machine. The production process is modeled as a network in which each machine is represented by an arc. A single machine or two or more machines in parallel compose a stage of the process. Several stages are combined to complete the network. The general model is formulated as a mixed zero-one programming problem for a finite planning horizon. This model can be further modified by adding specialized constraints to make it fit more specific cases. The general model has provisions for equivalence relationships to carry funds forward or backward through time. It also takes into account such items as process requirements and machine capacities. Difficulties are encountered in that a normal problem is too large to solve. Further study reveals that by making a conservative assumption of using a single interest rate the problem can be reduced to a much smaller zero-one programming problem. This formulation for a reasonably sized production process is small enough to be solved by zero-one algorithms available in the literature. An example problem is formulated for illustrative purposes.","abstract_has_math":false,"creators":["Ray, Thomas Gerald"],"institution":"Virginia Tech","degree_name":"Ph. D.","degree_level":"doctoral","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1971,"date_issued":"1971","date_published":"1971","updated_at":"2026-07-22T22:19:49Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-05132010-132806"],"render_values":[{"text":"etd-05132010-132806","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/37799","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["Ray, Thomas Gerald"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:11:01Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:11:01Z","2010-05-13"]},{"key":"dc:date.issued","label":"Date","values":["1971"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-05132010-132806"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/37799"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The object of this study is a new approach to the problem of replacement of assets which deteriorate and become obsolete with time. The investigator views replacement theory as a subset of capital budgeting. Capital budgeting has received much more attention, has benefited from many advances in mathematical programming techniques, and in general has been advanced to a much more sophisticated state of the art than has replacement theory. The approach taken in this work is to point out this divergence in advances in these areas by surveying the literature in each. Next a new approach to the replacement problem is presented. This approach is new in that it attacks the replacement problem as a system of interacting components rather than take the normal replacement approach to a single machine. The production process is modeled as a network in which each machine is represented by an arc. A single machine or two or more machines in parallel compose a stage of the process. Several stages are combined to complete the network. The general model is formulated as a mixed zero-one programming problem for a finite planning horizon. This model can be further modified by adding specialized constraints to make it fit more specific cases. The general model has provisions for equivalence relationships to carry funds forward or backward through time. It also takes into account such items as process requirements and machine capacities. Difficulties are encountered in that a normal problem is too large to solve. Further study reveals that by making a conservative assumption of using a single interest rate the problem can be reduced to a much smaller zero-one programming problem. This formulation for a reasonably sized production process is small enough to be solved by zero-one algorithms available in the literature. An example problem is formulated for illustrative purposes."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A systems approach to replacement"]}]}],"canonical_facts":{"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["Ray, Thomas Gerald"],"dc:date.accessioned":["2014-03-14T21:11:01Z"],"dc:date.available":["2014-03-14T21:11:01Z","2010-05-13"],"dc:date.issued":["1971"],"dc:description.abstract":["The object of this study is a new approach to the problem of replacement of assets which deteriorate and become obsolete with time. The investigator views replacement theory as a subset of capital budgeting. Capital budgeting has received much more attention, has benefited from many advances in mathematical programming techniques, and in general has been advanced to a much more sophisticated state of the art than has replacement theory. The approach taken in this work is to point out this divergence in advances in these areas by surveying the literature in each. Next a new approach to the replacement problem is presented. This approach is new in that it attacks the replacement problem as a system of interacting components rather than take the normal replacement approach to a single machine. The production process is modeled as a network in which each machine is represented by an arc. A single machine or two or more machines in parallel compose a stage of the process. Several stages are combined to complete the network. The general model is formulated as a mixed zero-one programming problem for a finite planning horizon. This model can be further modified by adding specialized constraints to make it fit more specific cases. The general model has provisions for equivalence relationships to carry funds forward or backward through time. It also takes into account such items as process requirements and machine capacities. Difficulties are encountered in that a normal problem is too large to solve. Further study reveals that by making a conservative assumption of using a single interest rate the problem can be reduced to a much smaller zero-one programming problem. This formulation for a reasonably sized production process is small enough to be solved by zero-one algorithms available in the literature. An example problem is formulated for illustrative purposes."],"dc:description.degree":["Ph. D."],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-05132010-132806"],"dc:identifier.uri":["http://hdl.handle.net/10919/37799"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A systems approach to replacement"],"dc:type":["Dissertation"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph. D."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:49Z"}