Dynamic Repair Allocation for a K Out of N System Maintained by Distinguishable Repairmen.

Abstract

The authors consider a K out of N system maintained by R repairmen, where the lifetime of the i sub th component is an exponentially distributed random variable with parameter micron sub i. Repairmen are distinguishable, and the time it takes the r sub th repairmen to repair a failed component is an exponentially distributed random variable with parameter lambda sub k. Repaired components are as good as new and preemptions are allowed. It is shown that the policy which assigns the faster repairmen to the most reliable components is optimal with respect to several optimality criteria. The approach taken in establishing stochastic optimality with respect to the number of functioning components is of wide applicability to different classes of stochastic optimization problems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 05, 1987
Accession Number
ADA185584

Entities

People

  • Costis Melolidakis
  • Michael N. Katehakis

Organizations

  • Columbia University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Computing-Related Activities
  • Contracts
  • Data Science
  • Decision Theory
  • Failed States
  • Information Science
  • Mathematics
  • New York
  • Operations Research
  • Optimization
  • Probability
  • Random Variables
  • Statistics
  • Theorems
  • Transitions
  • Universities

Readers

  • Facility/Structural Engineering.
  • Operations Research
  • Statistical inference.