Results 11 to 20 of about 4,426,237 (288)
Dynamic Physician Rostering in Emergency Departments: Managing Reentrant Patient Flows to Meet Excess Wait Time Targets. [PDF]
We develop a patient flow model that integrates return loops and formulate a risk‐aware physician rostering framework designed to strictly enforce excess wait time targets, for example, tail probability of delay (TPoD) service levels. We employ a simulation‐based iterative staffing approach (ISA) to determine the optimal number of physicians required ...
Dai X, Gao P, Xie X.
europepmc +2 more sources
Queueing Networks for Vertical Handover [PDF]
PhDIt is widely expected that next-generation wireless communication systems will be heterogeneous, integrating a wide variety of wireless access networks. Of particular interest recently is a mix of cellular networks (GSM/GPRS and WCDMA) and wireless
Song, Guozhi
core +4 more sources
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys [PDF]
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns.
Khalaf, Rehab
core +7 more sources
In the paper, a new method was presented using queueing theory models in order to ensure an optimal production department size, optimized production costs and optimal provision. Queueing/waiting mathematical models represent the development matrix for an
Laurentiu Rece +5 more
doaj +1 more source
Queues on interacting networks
Interacting networks are different in nature to single networks. The study of queuing processes on interacting networks is underdeveloped. It presents new mathematical challenges and is of importance to applications. This area of operations research deserves careful study: queuing theory needs to incorporate high-order network interactions in the ...
openaire +4 more sources
Analysis of Closed Queueing Networks with Batch Service [PDF]
We consider a closed queuing network with batch service and movements of customers in continuous time. Each node in the queueing network is an infinite capacity single server queueing system under a RANDOM discipline.
Stankevich, Elena Petrovna +2 more
doaj +1 more source
Calculation of time characteristics for acyclic fork-join queueing network [PDF]
An open acyclic fork-join queueing network is considered. When a job arrives from a source into the network, it is split to be serviced into a given constant number of associated tasks.
Postnova, Oksana Sergeevna +2 more
doaj +1 more source
The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in queueing theory. However, such systems have mostly been analysed by assuming homogeneous attributes of arrival and service processes ...
Dmitry Efrosinin +2 more
doaj +1 more source
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Could we employ the queueing theory to improve efficiency during future mass causality incidents?
Background Preparation for a disaster or accident-related mass casualty events is often based on experience. The objective measures or tools for evaluating decision-making and effectiveness during such events are underdeveloped.
Chih-Chuan Lin +3 more
doaj +1 more source

