Optimum Allocation of Components in a Special 2-Port Network

Kontoleon, J.M.

doi:10.1109/tr.1978.5220274

Cited by 10 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The role of position makes these systems more complicated than k-out-of-n systems. Consecutive k-out-of-n systems first appear in Kontoleon [9] and Chiang and Niu [4]. The literature on such systems and their generalizations is vast (see Chao, Fu, and Koutras [3] for references).…”

Section: Introductionmentioning

confidence: 99%

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

Flynn

Chung

2002

Naval Research Logistics

View full text Add to dashboard Cite

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete-time, infinite-horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k-out-of-n systems. The objective is to minimize the long-run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following 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 optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k-out-of-n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n.

show abstract

Section: Introductionmentioning

confidence: 99%

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

Flynn

Chung

2002

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…Η επιλογή του(των) μοντέλου(ων) βλαβών ψηφιακού κυκλώματος, για την ακριβή και υπολογιστικά αποτελεσματική ανάλυση της αξιο πιστίας του, προϋποθέτει τον άριστο συγκερασμό μεταξύ των μεθό δων της κλασικής αξιοπιστίας συστημάτων, των μεθόδων ανάλυσης, σχεδίασης και διάγνωσης βλαβών ψηφιακών κυκλωμάτων, την ερμηνεία των βλαβών στο ημιαγωγικό στρώμα κυκλωμάτων και τέλος την αποτε λεσματική λογική ανάλυση κυκλωμάτων με βλάβες, [18][19][20][21][32][33][34][35][36][37][38][39][40][41][42][43][44][67][68][69][70].…”

Section: μοντελα βλαβων ψηφιακων κυκλωματωνunclassified