Related papers: A modelling system for seaport activities
We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer centric elements, especially service time, and helps…
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…
Strategic customer behavior is strongly influenced by the level of information that is provided to customers. Hence, to optimize the design of queueing systems, many studies consider various versions of the same service model and compare…
This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…
Leveraging empirical data is crucial in the development of accurate and reliable virtual models for the advancement of autonomous ship technologies and the optimization of port operations. This study presents an in-depth analysis of ship…
In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions…
Delay or queue length information has the potential to influence the decision of a customer to use a service system. Thus, it is imperative for service system managers to understand how the information that they provide will affect the…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
What determines the average length of a queue which stretches in front of a service station? The answer to this question clearly depends on the average rate at which jobs arrive at the queue and on the average rate of service. Somewhat less…
To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating…
The efficiency of current cargo screening processes at sea and air ports is largely unknown as few benchmarks exists against which they could be measured. Some manufacturers provide benchmarks for individual sensors but we found no…
This paper presents the experimental set-up and the analysis tools developed for the performance evaluation in sailing. The measurement system is composed of sensors for the position and attitude of the sail boat, sensors for the wind…
We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…
This self-contained discussion relates the long-run average holding cost per unit time to the long-run average response time per customer in a $G/G/1$ queue with no assumption made on the order of service. The only restriction established…
We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
Modeling of work systems occurs for all sorts of reasons. Requirements need to be expressed. A pre-existing situation may need to be charted and analyzed. Early design decisions may be captured using architecture principles. Detailed design…