Optimal management of the machine repair problem with working vacation: Newton's method (Q732153)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5612613
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal management of the machine repair problem with working vacation: Newton's method
    scientific article; zbMATH DE number 5612613

      Statements

      Optimal management of the machine repair problem with working vacation: Newton's method (English)
      0 references
      0 references
      0 references
      0 references
      9 October 2009
      0 references
      According to authors' abstract the paper ``studies the M/M/1 machine repair problem with working vacation in which the server works with different repair rates rather than completely terminating the repair during a vacation period. We assume that the server begins the working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the MAPLE software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the direct search method and Newton's method for unconstrained optimization to repeatedly find the global minimum value until the system availability constraint is satisfied. Some numerical examples are provided to illustrate Newton's method''. The paper can be interested to students and scientists working in the area of optimal management of the machine repair problems.
      0 references
      0 references
      cost
      0 references
      optimization
      0 references
      working vacation
      0 references
      Newton's method
      0 references

      Identifiers