Vessels Arrival Process and its Application to the SHIP/M/ ∞ Queue

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In modeling of port dynamics it seems reasonable to assume that the ships arrive on a somewhat scheduled basis and that there is a constant lay period during which, in a uniform way, each vessel can arrive at the port. In the present paper, we study the counting process N(t) which represents the number of scheduled vessels arriving during the time interval (0, t], t> 0. Specifically, we provide the explicit expressions of the probability generating function, the probability distribution and the expected value of N(t). In some cases of interest, we also obtain the probability law of the stationary counting process representing the number of arrivals in a time interval of length t when the initial time is an arbitrarily chosen instant. This leads to various results concerning the autocorrelations of the random variables Xi, i∈ Z, which give the actual interarrival time between the (i- 1) -th and the i-th vessel arrival. Finally, we provide an application to a stochastic model for the queueing behavior at the port, given by a queueing system characterized by stationary interarrival times Xi, exponential service times and an infinite number of servers. In this case, some results on the average number of customers and on the probability of an empty queue are disclosed.

Cite

CITATION STYLE

APA

Di Crescenzo, A., Martinucci, B., & Paraggio, P. (2023). Vessels Arrival Process and its Application to the SHIP/M/ ∞ Queue. Methodology and Computing in Applied Probability, 25(1). https://doi.org/10.1007/s11009-023-10003-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free