Skip to main content

Optimal Allocation Problem in the Machine Repairman System with Heterogeneous Servers

  • Conference paper
Information Technologies and Mathematical Modelling (ITMM 2014)

Abstract

A controllable repairman model consists of L machines subject to failures and two repair servers working at different speeds. The problem of optimal allocation of failed machines between the servers is examined. The optimal control policy is calculated versus cost structures. As a result the optimal policy can be of threshold type, hysteretic type or have more complicated form. It is shown that the corresponding Markov process for hysteretic control policy belongs to the class of the Quasi-Birth-and-Death processes (QBD) with three diagonal block infinitesimal matrix. The stationary characteristics in this case are derived in matrix analytic form. Some numerical results are used to illustrate a number of features of the controlled model under study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artalejo, J.R., Economou, A.: Markovian controllable queueing systems with hysteretic policies: Busy period and waiting time analysis. Method. and Comp. in App. Prob. 7, 353–378 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Falin, G.I.: A multiserver retrial queue with a finite number of sources of primary calls. Math. and Comp. Mod. 20, 33–49 (1999)

    Article  MathSciNet  Google Scholar 

  3. Howard, R.: Dynamic Programming and Markov Processes. Wiley Series, New York (1960)

    MATH  Google Scholar 

  4. Mitrani, I.: Managing performance and power consumption in a server farm. Ann. Oper. Res. 202, 121–134 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Nobel, R., Tijms, H.C.: Optimal control of a queueing system with heterogeneous servers and set-up costs. IEEE Transactions on Automation Control 45(4), 780–784 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Le Ny, L.M., Tuffin, B.: A simple analysis of heterogeneous multi-server threshold queues with hysteresis. In: Proceedings of Applied Telecommunication Symposium (ATS) (2002)

    Google Scholar 

  7. Puterman, M.L.: Markov Decision Process: Discrete Stochastic Dynamic Programming. John Wiley&Sons, New-York (1994)

    Book  MATH  Google Scholar 

  8. Tijms, H.C.: Stochastic Models. An Algorithmic Approach. John Wiley&Sons, New-York (1994)

    MATH  Google Scholar 

  9. Roszik, J., Sztrik, J.: Performance analysis of finite-source retrial queues with nonreliable heterogeneous servers. J. of Math. Sciences 146, 6033–6038 (2007)

    Article  MathSciNet  Google Scholar 

  10. Rykov, V., Efrosinin, D.: On the slow server problem. Autom. and Rem. Control 70(12), 2013–2023 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Efrosinin, D., Spannring, C., Sztrik, J. (2014). Optimal Allocation Problem in the Machine Repairman System with Heterogeneous Servers. In: Dudin, A., Nazarov, A., Yakupov, R., Gortsev, A. (eds) Information Technologies and Mathematical Modelling. ITMM 2014. Communications in Computer and Information Science, vol 487. Springer, Cham. https://doi.org/10.1007/978-3-319-13671-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13671-4_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13670-7

  • Online ISBN: 978-3-319-13671-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics