IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v63y2003i6p615-627.html
   My bibliography  Save this article

Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities

Author

Listed:
  • Ianovsky, Edward
  • Kreimer, Joseph

Abstract

We present optimality conditions for real-time multiserver system with large number of identical servers (e.g. unmanned air vehicles, machine controllers, etc.) and two non-identical channels (e.g. surveillance regions, assembly lines, etc.) working under maximum load regime with limited maintenance facilities. Real-time systems are responsible for operations management of increasingly sensitive applications, particularly those in which failures to satisfy temporal restrictions can lead to serious or even dangerous consequences. Optimization of these systems is very important. We calculate limiting values of system availability and its loss penalty function and show how to obtain optimal assignment probabilities which optimize (maximize and minimize, respectively) these performance measures.

Suggested Citation

  • Ianovsky, Edward & Kreimer, Joseph, 2003. "Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(6), pages 615-627.
    • Handle: RePEc:eee:matcom:v:63:y:2003:i:6:p:615-627
    DOI: 10.1016/S0378-4754(03)00092-2
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475403000922
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/S0378-4754(03)00092-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Kreimer, Joseph, 2000. "Real-time multiserver system with two non-identical channels and limited maintenance facilities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 53(1), pages 85-94.
    2. Sudarshan K. Dhall & C. L. Liu, 1978. "On a Real-Time Scheduling Problem," Operations Research, INFORMS, vol. 26(1), pages 127-140, February.
    3. Kreimer, Joseph & Mehrez, Abraham, 1993. "An optimal operation policy for real-time n-server stand-by systems involving preventive maintenance," European Journal of Operational Research, Elsevier, vol. 69(1), pages 50-54, August.
    4. Jean-Yves Potvin & Samy Bengio, 1996. "The Vehicle Routing Problem with Time Windows Part II: Genetic Search," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 165-172, May.
    5. Joseph Kreimer & Abraham Mehrez, 1994. "Optimal Real-Time Data Acquisition and Processing by a Multiserver Stand-by System," Operations Research, INFORMS, vol. 42(1), pages 24-30, February.
    6. Litoiu, Marin & Tadei, Roberto, 1997. "Real time task scheduling allowing fuzzy due dates," European Journal of Operational Research, Elsevier, vol. 100(3), pages 475-481, 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. Edward Ianovsky & Joseph Kreimer, 2011. "An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach)," Annals of Operations Research, Springer, vol. 189(1), pages 215-253, September.

    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. Kreimer, Joseph, 2000. "Real-time multiserver system with two non-identical channels and limited maintenance facilities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 53(1), pages 85-94.
    2. Edward Ianovsky & Joseph Kreimer, 2011. "An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach)," Annals of Operations Research, Springer, vol. 189(1), pages 215-253, September.
    3. Rabinowitz, Gadi & Goren, Shai & Mehrez, Abraham, 2000. "Scheduling two machines that require multiple types of maintenance, for a single operation," European Journal of Operational Research, Elsevier, vol. 127(3), pages 546-564, December.
    4. Nathan Companez & Aldeida Aleti, 2016. "Can Monte-Carlo Tree Search learn to sacrifice?," Journal of Heuristics, Springer, vol. 22(6), pages 783-813, December.
    5. repec:iim:iimawp:14638 is not listed on IDEAS
    6. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    7. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    8. Bochra Rabbouch & Foued Saâdaoui & Rafaa Mraihi, 2021. "Efficient implementation of the genetic algorithm to solve rich vehicle routing problems," Operational Research, Springer, vol. 21(3), pages 1763-1791, September.
    9. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    10. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    11. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    12. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    13. Łuczka, Jerzy, 1988. "On Markovian kinetic equations: Zubarev's nonequilibrium statistical operator approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 149(1), pages 245-266.
    14. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Gorini, Vittorio & Verri, Maurizio & Frigerio, Alberto, 1989. "Non-markovian behavior in low-temperature damping," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 161(2), pages 357-384.
    16. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    17. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    18. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    19. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    20. Hong, Sung-Chul & Park, Yang-Byung, 1999. "A heuristic for bi-objective vehicle routing with time window constraints," International Journal of Production Economics, Elsevier, vol. 62(3), pages 249-258, September.
    21. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, 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:matcom:v:63:y:2003:i:6:p:615-627. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.