IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v198y2009i2p545-556.html
   My bibliography  Save this article

Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous markov modeling

Author

Listed:
  • Koutras, V.P.
  • Platis, A.N.
  • Gravvanis, G.A.

Abstract

Resource availability optimization is studied on a server-client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users' requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability.

Suggested Citation

  • Koutras, V.P. & Platis, A.N. & Gravvanis, G.A., 2009. "Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous markov modeling," European Journal of Operational Research, Elsevier, vol. 198(2), pages 545-556, October.
    • Handle: RePEc:eee:ejores:v:198:y:2009:i:2:p:545-556
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00767-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J Ou & M Parlar & M Sharafali, 2006. "A differentiated service scheme to optimize website revenues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(11), pages 1323-1340, November.
    2. Beausoleil, Ricardo P., 2006. ""MOSS" multiobjective scatter search applied to non-linear multiple criteria optimization," European Journal of Operational Research, Elsevier, vol. 169(2), pages 426-449, March.
    3. Sarker, Ruhul & Liang, Ko-Hsin & Newton, Charles, 2002. "A new multiobjective evolutionary algorithm," European Journal of Operational Research, Elsevier, vol. 140(1), pages 12-23, July.
    4. Alves, Maria Joao & Climaco, Joao, 2000. "An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound," European Journal of Operational Research, Elsevier, vol. 124(3), pages 478-494, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iannoni, Ana Paula & Chiyoshi, Fernando & Morabito, Reinaldo, 2015. "A spatially distributed queuing model considering dispatching policies with server reservation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 49-66.
    2. Pazour, Jennifer A. & Roy, Debjit, 2012. "Minimizing Customer Waiting Costs for Rental Vehicle Providers using Threshold Reservation Policies," IIMA Working Papers WP2012-12-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Kirytopoulos, Konstantinos & Voulgaridou, Dimitra & Platis, Agapios & Leopoulos, Vrassidas, 2011. "An effective Markov based approach for calculating the Limit Matrix in the analytic network process," European Journal of Operational Research, Elsevier, vol. 214(1), pages 85-90, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Min-Rong & Lu, Yong-Zai, 2008. "A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 637-651, August.
    2. Wang, Haijun & Du, Lijing & Ma, Shihua, 2014. "Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 160-179.
    3. Gong, Wenyin & Cai, Zhihua, 2009. "An improved multiobjective differential evolution based on Pareto-adaptive [epsilon]-dominance and orthogonal design," European Journal of Operational Research, Elsevier, vol. 198(2), pages 576-601, October.
    4. Jacinto Martín & Concha Bielza & David Ríos Insua, 2005. "Approximating nondominated sets in continuous multiobjective optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 469-480, August.
    5. Jieguang He & Xin Chen & Xindu Chen & Qiang Liu, 2016. "Distributed production planning based on ATC and MOILP considering different coordination patterns," Journal of Intelligent Manufacturing, Springer, vol. 27(5), pages 1067-1084, October.
    6. Quan, Gang & Greenwood, Garrison W. & Liu, Donglin & Hu, Sharon, 2007. "Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1969-1984, March.
    7. A. R. Rahimi-Vahed & S. M. Mirghorbani, 2007. "A multi-objective particle swarm for a flow shop scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 79-102, January.
    8. Galinina Anna & Burceva Olga & Parshutin Sergei, 2012. "The Optimization of COCOMO Model Coefficients Using Genetic Algorithms," Information Technology and Management Science, Sciendo, vol. 15(1), pages 45-51, December.
    9. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    10. Keliang Chang & Hong Zhou & Guijing Chen & Huiqin Chen, 2017. "Multiobjective Location Routing Problem considering Uncertain Data after Disasters," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-7, March.
    11. Alves, Maria João & Costa, João Paulo, 2016. "Graphical exploration of the weight space in three-objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 248(1), pages 72-83.
    12. Alves, Maria Joao & Climaco, Joao, 2004. "A note on a decision support system for multiobjective integer and mixed-integer programming problems," European Journal of Operational Research, Elsevier, vol. 155(1), pages 258-265, May.
    13. Isada, Yuriko & James, Ross J. W. & Nakagawa, Yuji, 2005. "An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint," European Journal of Operational Research, Elsevier, vol. 162(2), pages 503-513, April.
    14. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    15. Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
    16. Chia-Wei Kuo & Kwei-Long Huang & Chao-Lung Yang, 2017. "Optimal contract design for cloud computing service with resource service guarantee," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1030-1044, September.
    17. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    18. Kerkhove, L.-P. & Vanhoucke, M., 2017. "A parallel multi-objective scatter search for optimising incentive contract design in projects," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1066-1084.
    19. Ustun, Ozden & DemI[dot above]rtas, Ezgi Aktar, 2008. "An integrated multi-objective decision-making process for multi-period lot-sizing with supplier selection," Omega, Elsevier, vol. 36(4), pages 509-521, August.
    20. Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:198:y:2009:i:2:p:545-556. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.