Optimizing the throughput of particulate streams subject to blocking

DOI10.1088/1742-5468/AAC90EzbMATH Open1459.60152arXiv1803.04406OpenAlexW2793522860MaRDI QIDQ4964643FDOQ4964643

Authors: Gregory Page, J. Resing, Pascal Viot, Julian Talbot 

Publication date: 2 March 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: Filtration, flow in narrow channels and traffic flow are examples of processes subject to blocking when the channel conveying the particles becomes too crowded. If the blockage is temporary, which means that after a finite time the channel is flushed and reopened, one expects to observe a maximum throughput for a finite intensity of entering particles. We investigate this phenomenon by introducing a queueing theory inspired, circular Markov model. Particles enter a channel with intensity $lambda$ and exit at a rate $mu$. If $N$ particles are present at the same time in the channel, the system becomes blocked and no more particles can enter until the blockage is cleared after an exponentially distributed time with rate $m{u}^{*}$. We obtain an exact expression for the steady state throughput (including the exiting blocked particles) for all values of $N$. For $N=2$ we show that the throughput assumes a maximum value for finite $lambda$ if $m{u}^{*}/mu<1/4$. The time-dependent throughput either monotonically approaches the steady state value, or reaches a maximum value at finite time. We demonstrate that, in the steady state, this model can be mapped to a previously introduced non-Markovian model with fixed transit and blockage times. We also examine an irreversible, non-Markovian blockage process with constant transit time exposed to an entering flux of fixed intensity for a finite time and we show that the first and second moments of the number of exiting particles are maximized for a finite intensity.

Full work available at URL: https://arxiv.org/abs/1803.04406

Recommendations

• Irreversible blocking in single-file concurrent and countercurrent particulate flows
• Models of blockage-induced selectivity
• Filters. The Number of Channels That Can Clog in a Network
• Transient behaviour of finite capacity tandem queues with blocking
• Blocking, reordering, and the throughput of a series of servers

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Queues and service in operations research (90B22) Flows in porous media; filtration; seepage (76S05) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Sequential Arrays of Waiting Lines
• Title not available (Why is that?)
• Scaling of pedestrian channel flow with a bottleneck
• Flow of pedestrians through narrow doors with different competitiveness

Cited In (1)

• Locating flow-intercepting facilities: New approaches and results

This page was built for publication: Optimizing the throughput of particulate streams subject to blocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964643)