IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i4p594-d749397.html
   My bibliography  Save this article

Performance Measures in a Generalized Asymmetric Simple Inclusion Process

Author

Listed:
  • Yaron Yeger

    (School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel)

  • Uri Yechiali

    (School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel)

Abstract

Performance measures are studied for a generalized n-site asymmetric simple inclusion process (G-ASIP), where a general process controls intervals between gate-opening instants. General formulae are obtained for the Laplace–Stieltjes transform, as well as the means, of the (i) traversal time, (ii) busy period, and (iii) draining time. The PGF and mean of (iv) the system’s overall load are calculated, as well as the probability of an empty system, along with (v) the probability that the first occupied site is site k ( k = 1, 2, …, n ). Explicit results are derived for the wide family of gamma-distributed gate inter-opening intervals (which span the range between the exponential and the deterministic probability distributions), as well as for the uniform distribution. It is further shown that a homogeneous system, where at gate-opening instants gate j opens with probability p j = 1 n , is optimal with regard to (i) minimizing mean traversal time, (ii) minimizing the system’s load, (iii) maximizing the probability of an empty system, (iv) minimizing the mean draining time, and (v) minimizing the load variance. Furthermore, results for these performance measures are derived for a homogeneous G-ASIP in the asymptotic cases of (i) heavy traffic, (ii) large systems, and (iii) balanced systems.

Suggested Citation

  • Yaron Yeger & Uri Yechiali, 2022. "Performance Measures in a Generalized Asymmetric Simple Inclusion Process," Mathematics, MDPI, vol. 10(4), pages 1-25, February.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:4:p:594-:d:749397
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/4/594/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/4/594/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Onno Boxma & Offer Kella & Uri Yechiali, 2016. "An ASIP model with general gate opening intervals," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 1-20, October.
    2. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    3. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, 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. Uri Yechiali & Yaron Yeger, 2022. "Matrix Approach for Analyzing n -Site Generalized ASIP Systems: PGF and Site Occupancy Probabilities," Mathematics, MDPI, vol. 10(23), pages 1-33, December.

    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. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    2. Sauer Cornelia & Daduna Hans, 2003. "Availability Formulas and Performance Measures for Separable Degradable Networks," Stochastics and Quality Control, De Gruyter, vol. 18(2), pages 165-194, January.
    3. Bing Lin & Rohit Bhatnagar & Yuchen Lin, 2024. "Admission Control of Parallel Queues with Fork Types of Jobs," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-30, December.
    4. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    5. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    6. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    7. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    8. John S. Hollywood, 2005. "An approximate planning model for distributed computing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 590-605, September.
    9. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    10. Haskose, A. & Kingsman, B. G. & Worthington, D, 2004. "Performance analysis of make-to-order manufacturing systems under different workload control regimes," International Journal of Production Economics, Elsevier, vol. 90(2), pages 169-186, July.
    11. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    12. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    13. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.
    14. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    15. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    16. Veneklaas, W. & Leeftink, A.G. & van Boekel, P.H.C.M. & Hans, E.W., 2021. "On the design, implementation, and feasibility of hospital admission services: The admission lounge case," Omega, Elsevier, vol. 100(C).
    17. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    18. Liu, Xiaoming & Lian, Zhaotong, 2009. "Cost-effective inventory control in a value-added manufacturing system," European Journal of Operational Research, Elsevier, vol. 196(2), pages 534-543, July.
    19. Uri Yechiali & Yaron Yeger, 2022. "Matrix Approach for Analyzing n -Site Generalized ASIP Systems: PGF and Site Occupancy Probabilities," Mathematics, MDPI, vol. 10(23), pages 1-33, December.
    20. Haskose, A. & Kingsman, B. G. & Worthington, D., 2002. "Modelling flow and jobbing shops as a queueing network for workload control," International Journal of Production Economics, Elsevier, vol. 78(3), pages 271-285, August.

    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:gam:jmathe:v:10:y:2022:i:4:p:594-:d:749397. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.