Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication12
  4. Cost Optimization of Maintenance Scheduling for a System with Assured Reliability
 
  • Details
Options

Cost Optimization of Maintenance Scheduling for a System with Assured Reliability

Date Issued
01-01-1992
Author(s)
Jayabalan, V.
Chaudhuri, Dipak
DOI
10.1109/24.126665
Abstract
Systems which have to work at or below a maximum acceptable failure rate, should be maintained at predetermined points such that the failure rate does not exceed the acceptable level. As the system ages, the post-maintenance failure rate of the system drops to some newer one, unless the system has been replaced, but does not restore the system to the original state. Thii paper presents a branching algorithm with effective dominance rules that curtail the number of nodes created; this algorithm determines the number of maintenance interventions before each replacement in order to minimize the total cost over a finite time horizon. The model considers inflationary trends. A numerical example and computational experience demonstrate the algorithm. Most papers on maintenance problems have considered the maintenance interval as constant and increasing cost for successive maintenance for a system. This paper treats the maintenance cost as constant and successive simple-maintenance intervals as decreasing. Though our algorithm assumes that the cost/maintenance is constant, any increasing maintenance cost function could be incorporated. The optimum solutions depend on the: constant improvement factor first simple-maintenance point rate of increase in acquisition cost maintenance cost factor planning period. © 1992 IEEE
Volume
41
Subjects
  • branching algorithm

  • improvement factor

  • preventive replacemen...

  • simple preventive mai...

Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback