Results 131 to 140 of about 8,617 (316)

Gordon and Newell queueing networks and copulas

open access: yes
In this paper we have found an analytical formula for a copula that connects the numbers Ni of customers in the nodes of a Gordon and Newell queueing network.
Ciuiu, Daniel
core  

Velocity‐based stowage policy for a semiautomated fulfillment system

open access: yesProduction and Operations Management, EarlyView., 2022
Abstract Online retail fulfillment is increasingly performed by semiautomated fulfillment systems in which inventory is stored in mobile pods that are moved by robotic drives. In this paper, we develop a model that explores the benefits of velocity‐based stowage policies for semiautomated fulfillment systems, also known as robotic mobile fulfillment ...
Tolga Cezik   +2 more
wiley   +1 more source

HEAVY TRAFFIC ANALYSIS IN QUEUEING SYSTEMS

open access: yesStudia Universitatis Moldaviae: Stiinte Umanistice, 2008
The traffic intensity is defined in the classical theory of queueing systems as the ratio of the expected service time and the expected interarrival time and is an important measure of the system performance.
USM ADMIN
doaj  

Performance analysis of communication systems using Queueing Network ToolBox

open access: yes, 2011
Performance analysis of Communication systems Using Queueing Network ToolBoxBscprogramtervező ...
Zhang, Jian
core  

Distributed computing for the reconstruction of multi‐terabyte tomographic X‐ray imaging datasets

open access: yesJournal of Synchrotron Radiation, EarlyView.
As tomographic datasets from synchrotrons continue to increase in volume, so rises the challenge of reconstructing said data. Here we present a solution utilizing high‐performance computing capabilities to split the process into multiple smaller tasks, which can be solved without overwhelming a single compute node.
Thorbjørn Erik Køppen Christensen   +5 more
wiley   +1 more source

Queueing and Markov chain decomposition method to analyze Markov-modulated Markov chains

open access: yes, 2021
We present a Queueing and Markov chain decomposition method based on the total expectation theorem. Our decomposition method requires partial flow to be conserved, which we call a termination scheme.
Sasanuma, Katsunobu
core  

What England Is and What It Claims to Be: Orwell on National Identity

open access: yesThe Political Quarterly, EarlyView.
Abstract This article suggests that George Orwell's body of work offers a rather unique and insightful two‐part conception of national identity in the context of England, made up of a moral inheritance—the values of liberty, fairness and decency—and a lived sensibility—the fluid, experiential quality of collective life expressed in shared customs ...
Sam Taylor Hill
wiley   +1 more source

Strategic Queueing Behavior of Two Groups of Patients in a Healthcare System

open access: yesMathematics
Long waiting times and crowded services are the current medical situation in China. Especially in hierarchic healthcare systems, as high-quality medical resources are mainly concentrated in comprehensive hospitals, patients are too concentrated in these ...
Youxin Liu   +3 more
doaj   +1 more source

STABILITY OF THE CRITICAL QUEUEING SYSTEMS

open access: yesJournal of the Operations Research Society of Japan, 1982
This paper considers the stability of the waiting time in the queueing system with the critical condi- tion: ESi = sETi. It is shown that the waiting time is stable in the model with special moving average input and the unstability condition is obtained in the strictly stationary input with the finite variance.
openaire   +3 more sources

Home - About - Disclaimer - Privacy