مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

275
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

75
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY

Pages

  29-40

Abstract

 This paper analyzes a controllable DISCRETE-TIME machine repair problem with L operating machines and two technicians. The number of working servers can be adjusted depending on the number of failed machines in the system one at a time at machine's failure or at service completion epochs. Analytical closed-form solutions of the stationary probabilities of the number of failed machines in the system are obtained. We develop the total expected COST function per machine per unit time and obtain the optimal operating policy and the optimal service rate at minimum COST using QUADRATIC T SEARCH METHOD and simulated annealing method. Various performance measures along with numerical results to illustrate the influence of various parameters on the buffer behavior are also presented.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    GOSWAMI, V., & VIJAYA LAXMI, P.. (2015). ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, 5(1), 29-40. SID. https://sid.ir/paper/328303/en

    Vancouver: Copy

    GOSWAMI V., VIJAYA LAXMI P.. ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION[Internet]. 2015;5(1):29-40. Available from: https://sid.ir/paper/328303/en

    IEEE: Copy

    V. GOSWAMI, and P. VIJAYA LAXMI, “ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY,” INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, vol. 5, no. 1, pp. 29–40, 2015, [Online]. Available: https://sid.ir/paper/328303/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button