Results 111 to 120 of about 8,617 (316)
Inference for double Pareto lognormal queues with applications [PDF]
In this article we describe a method for carrying out Bayesian inference for the double Pareto lognormal (dPlN) distribution which has recently been proposed as a model for heavy-tailed phenomena. We apply our approach to inference for the dPlN/M/1 and M/
Michael P. Wiper +3 more
core
Dynamic server allocation for unstable queueing networks with flexible servers
, 2011 This paper is concerned with the dynamic assignment of servers to tasks in queueing networks where demand may exceed the capacity for service. The objective is to maximize the system throughput. We use fluid limit analysis to show that several quantities
Douglas G. Down +5 more
core +1 more source
Sustainable Development, EarlyView.ABSTRACT The dynamic nature of small islands being geographically isolated and their perceived connectedness with global networks complicates research attempts to draw general conclusions on whether insularity leads to marginalization or strengthens their resilience for sustainable development.
Toheeb Lekan Jolaosho +2 more
wiley +1 more source
A tight bound on the throughput of queueing networks with blocking [PDF]
In this paper, we present a bounding methodology that allows to compute a tight lower bound on the cycle time of fork--join queueing networks with blocking and with general service time distributions. The methodology relies on two ideas.
SEMAL, Pierre +2 more
core
Sustainable Development, EarlyView.ABSTRACT This article examines whether economic growth reduces inequalities in access to water and sanitation across 64 countries over an average period of 13.5 years. Drawing on disaggregated data by income quintiles and rural–urban location, and employing ordinary least squares (OLS), two‐stage least squares (2SLS), and Seemingly Unrelated Regression
Marcos García‐López +2 more
wiley +1 more source
Robustness in queueing systems
, 2014 We study the robustness of performance predictions of discrete- time finite-capacity queues by applying the framework of imprecise probabilities. More precisely, we consider the Geo/Geo/1/L model with probabilities of arrival and departure that are no longer fixed, but are allowed to vary within given intervals.
openaire +2 more sources
The power-series algorithm applied to cyclic polling systems
Polling Systems;Queueing Theory;operations ...
Blanc, J.P.C.
core
AI‐Driven Circular Construction Waste Management for Advancing Sustainable Development
Sustainable Development, EarlyView.ABSTRACT Construction and demolition waste (C&DW) represents up to 40% of global solid waste, posing a significant barrier to achieving circular economy (CE) objectives and the Sustainable Development Goals (SDGs), particularly SDG 11 and SDG 12. However, construction waste management (CWM) systems remain constrained by fragmented data environments ...
Mohamed T. Elnabwy, Pablo Martinez
wiley +1 more source
Firefly algorithm in optimization of queueing systems
, 2012 . Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process.
Kwiecień, J. +3 more
core +1 more source