Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: A branch-and-bound algorithm for computing optimal replacement policies in k-out-of-n systems

Title:
A branch-and-bound algorithm for computing optimal replacement policies in k-out-of-n systems
Authors:
CHUNG, C.-S, FLYNN, J
Source:
Operations research. 43(5):826-837
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1995.
Publication Year:
1995
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Théorie de la fiabilité. Renouvellement des équipements, Reliability theory. Replacement problems, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Entretien préventif, Preventive maintenance, Entretenimiento preventivo, Horizon infini, Infinite horizon, Horizonte infinito, Maintenance système, System maintenance, Mantenimiento sistema, Modélisation, Modeling, Modelización, Méthode branch and bound, Branch and bound method, Método branch and bound, Paramètre critique, Critical parameter, Parámetro crítico, Programmation dynamique, Dynamic programming, Programación dinámica, Remplacement, Replacement, Reemplazo, Système binaire, Binary system, Sistema binario, Système k parmi n, K out of n system, Sistema k entre n
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Cleveland State univ., Cleveland OH, United States
ISSN:
0030-364X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=2916415
Rights:
Copyright 1996 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.2916415
Database:
PASCAL Archive

Weitere Informationen

We study a discrete time, infinite-horizon, dynamic programming model for the replacement of components in a binary coherent system with n components. Costs are incurred when the system fails and when failed components are replaced. The objective is to minimize the expected discounted infinite-horizon cost or the long-run expected average undiscounted cost per period. An earlier paper found general conditions under which it is optimal to follow a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule : Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a binary nonlinear programming problem in n variables. This paper specializes to k-out-of-n systems and develops a branch-and-bound algorithm for finding an optimal decision. Its memory storage requirement is O((n + 1)(n - k + 1)), and the number of nodes examined is under O(nk). Extensive computational experiments with n ranging from 10 to 100 find it to be effective when k is small or near n. In our 120,000 test problems with k = n (parallel systems), the average computation time on a 20 Mhz 386 microcomputer is 0.106 seconds.