Relevant bibliographies by topics / Service of queues

Academic literature on the topic 'Service of queues'

Author: Grafiati
Published: 30 May 2022
Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Service of queues.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Service of queues"

1

Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.

Full text
Abstract:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
APA, Harvard, Vancouver, ISO, and other styles
2

Yurindra, Yurindra, Ari Amir Alkodri, Anisah Anisah, and Supardi Supardi. "Aplikasi Client Server Berbasis Android pada Barbershop The Barbega Menggunakan Model Multi Channel - Single Phase." Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, no. 1 (April 27, 2020): 138. http://dx.doi.org/10.32736/sisfokom.v9i1.837.

Full text
Abstract:
A common problem that is often faced by almost most Barbershop is in terms of serving customer queues, for barbershops who have many customers and have many service chairs, then of course a good customer queue service management concept is needed as well. One of the concepts of queuing services for customers is how queue information can reach customers without queuing at the location. For this reason, a queue service concept for customers is needed based on Android. Android is preferred because almost all smartphone users are currently based on Android. The application will be built based on the concept of client server so that the queue service will occur in real time. The Queuing model used is Multi Channel Single Phase, because in the queue at barbershop there will only be one stage of the process, but it requires a lot of queue flow. This can be seen in the structure of the development diagram. By using an Android-based application based on a single phase multi channel model that will be built it is ensured that customers will find it helpful, without having to spend time in a queue customers can order queues and see queues in real time so they can rush to barbershop when it is close to the queue
APA, Harvard, Vancouver, ISO, and other styles
3

Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 1 (March 2006): 274–81. http://dx.doi.org/10.1239/jap/1143936259.

Full text
Abstract:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C1 and C2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
APA, Harvard, Vancouver, ISO, and other styles
4

Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 01 (March 2006): 274–81. http://dx.doi.org/10.1017/s0021900200001522.

Full text
Abstract:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C 1 and C 2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
APA, Harvard, Vancouver, ISO, and other styles
5

Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 01 (March 1996): 308–26. http://dx.doi.org/10.1017/s0001867800027385.

Full text
Abstract:
Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.
APA, Harvard, Vancouver, ISO, and other styles
6

Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 1 (March 1996): 308–26. http://dx.doi.org/10.2307/1427923.

Full text
Abstract:
Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.
APA, Harvard, Vancouver, ISO, and other styles
7

van Ommeren, Jan-Kees, Ahmad Al Hanbali, and Richard J. Boucherie. "Analysis of polling models with a self-ruling server." Queueing Systems 94, no. 1-2 (November 22, 2019): 77–107. http://dx.doi.org/10.1007/s11134-019-09639-6.

Full text
Abstract:
AbstractPolling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.
APA, Harvard, Vancouver, ISO, and other styles
8

Boxma, Onno, Mayank Saxena, Stella Kapodistria, and Rudesindo Núñez Queija. "Two queues with random time-limited polling." Probability and Mathematical Statistics 37, no. 2 (May 14, 2018): 257–89. http://dx.doi.org/10.19195/0208-4147.37.2.4.

Full text
Abstract:
TWO QUEUES WITH RANDOM TIME-LIMITED POLLINGIn this paper, we analyse a single server polling model withtwo queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues withgenerally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is noswitch-over time. For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis.
APA, Harvard, Vancouver, ISO, and other styles
9

Comte, Céline, and Jan-Pieter Dorsman. "Pass-and-swap queues." Queueing Systems 98, no. 3-4 (April 12, 2021): 275–331. http://dx.doi.org/10.1007/s11134-021-09700-3.

Full text
Abstract:
AbstractOrder-independent (OI) queues, introduced by Berezner et al. (Queueing Syst 19(4):345–359, 1995), expanded the family of multi-class queues that are known to have a product-form stationary distribution by allowing for intricate class-dependent service rates. This paper further broadens this family by introducing pass-and-swap (P&S) queues, an extension of OI queues where, upon a service completion, the customer that completes service is not necessarily the one that leaves the system. More precisely, we supplement the OI queue model with an undirected graph on the customer classes, which we call a swapping graph, such that there is an edge between two classes if customers of these classes can be swapped with one another. When a customer completes service, it passes over customers in the remainder of the queue until it finds a customer it can swap positions with, that is, a customer whose class is a neighbor in the graph. In its turn, the customer that is ejected from its position takes the position of the next customer it can be swapped with, and so on. This is repeated until a customer can no longer find another customer to be swapped with; this customer is the one that leaves the queue. After proving that P&S queues have a product-form stationary distribution, we derive a necessary and sufficient stability condition for (open networks of) P&S queues that also applies to OI queues. We then study irreducibility properties of closed networks of P&S queues and derive the corresponding product-form stationary distribution. Lastly, we demonstrate that closed networks of P&S queues can be applied to describe the dynamics of new and existing load-distribution and scheduling protocols in clusters of machines in which jobs have assignment constraints.
APA, Harvard, Vancouver, ISO, and other styles
10

Boxma, O. J., and W. P. Groenendijk. "Pseudo-conservation laws in cyclic-service systems." Journal of Applied Probability 24, no. 4 (December 1987): 949–64. http://dx.doi.org/10.2307/3214218.

Full text
Abstract:
This paper considers single-server, multi-queue systems with cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. A stochastic decomposition for the amount of work in such systems is obtained. This decomposition allows a short derivation of a ‘pseudo-conservation law' for a weighted sum of the mean waiting times at the various queues. Thus several recently proved conservation laws are generalised and explained.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Service of queues"

1

Magalhaes, Marcos N. "Queues with a Markov renewal service process." Diss., Virginia Polytechnic Institute and State University, 1988. http://hdl.handle.net/10919/53582.

Full text
Abstract:
In the present work, we study a queue with a Markov renewal service process. The objective is to model systems where different customers request different services and there is a setup time required to adjust from one type of service to the next. The arrival is a Poisson process independent of the service. After arrival, all the customers will be attended in order of arrival. Immediately before a service starts, the type of next customer is chosen using a finite, irreducible and aperiodic Markov chain P. There is only one server and the service time has a distribution function Fij, where i and j are the types of the previous and current customer in service, respectively. This model will be called M/MR/l. Embedding at departure epochs, we characterize the queue length and the type of customer as a Markov renewal process. We study a special case where Fij, is exponential with parameter μij. We prove that the departure is a renewal process if and only if μij = μ , A i j ε E. Furthermore, we show that this renewal is a Poisson process. The type-departure process is extensively studied through the respective counting processes. The crosscovariance and the crosscorrelation are computed and numerical results are shown. Finally, we introduce several expressions to study the interdependence among the type·departure processes in the general case, i.e. the distribution function Fij, does not have any special form.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Kuo-Hwa. "Extreme queues and stationarity of heavy-traffic service systems." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/25441.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yudovina, Elena. "Collaborating queues : large service network and a limit order book." Thesis, University of Cambridge, 2012. https://www.repository.cam.ac.uk/handle/1810/243943.

Full text
Abstract:
We analyse the steady-state behaviour of two different models with collaborating queues: that is, models in which 'customers' can be served by many types of 'servers', and 'servers' can process many types of 'customers'. The first example is a large-scale service system, such as a call centre. Collaboration is the result of cross-trained staff attending to several different types of incoming calls. We first examine a load-balancing policy, which aims to keep servers in different pools equally busy. Although the policy behaves order-optimally over fixed time horizons, we show that the steady-state distribution may fail to be tight on the diffusion scale. That is, in a family of ever-larger networks whose arrival rates grow as O(r) (where r is a scaling parameter growing to infinity), the sequence of steady-state deviations from equilibrium scaled down by sqrt(r) is not tight. We then propose a different policy, for which we show that the sequence of invariant distributions is tight on the r (1/2+epsilon) scale, for any epsilon > 0. For this policy we conjecture that tightness holds on the diffusion scale as well. The second example models a limit order book, a pricing mechanism for a single-commodity market in which buyers (respectively sellers) are prepared to wait for the price to drop (respectively rise). We analyse the behaviour of a simplified model, in which the arrival events are independent of each other and the state of the limit order book. The system can be represented by a queueing model, with 'customers' and 'servers' corresponding to bids and asks; the roles of customers and servers are symmetric. We show that, with probability 1, the price interval breaks up into three regions. At small (respectively large) prices, only finitely many bid (respectively ask) orders ever get fulfilled, while in the middle region all orders eventually clear. We derive equations which define the boundaries between these regions, and solve them explicitly in the case of iid uniform arrivals to obtain numeric values of the thresholds. We derive a heuristic for the distribution of the highest bid (respectively lowest ask), and present simulation data confirming it.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Bo. "Scalable analysis and design of service systems." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39533.

Full text
Abstract:
In this dissertation, we develop analytical and computational tools for performance analysis and design of large-scale service systems. The dissertation consists of three main chapters. The first chapter is devoted to devising efficient task assignment policies for large-scale service system models from a rare event analysis standpoint. Specifically, we study the steady-state behavior of multi-server queues with general job size distributions under size-interval task assignment (SITA) policies. Assuming Poisson arrivals and the existence of the alpha-th moment of the job size distribution for some alpha> 1, we show that if the job arrival rate and the number of servers increase to infinity with the traffic intensity held fixed, a SITA policy parameterized by alpha minimizes in a large deviation sense the steady-state probability that the total number of jobs in the system is greater than or equal to the number of servers. The optimal large deviation decay rate can be arbitrarily close to the one for the corresponding probability in an infinite-server queue, which only depends on the system traffic intensity but not on any higher moments of the job size distribution. This supports in a many-server asymptotic framework the common wisdom that separating large jobs from small jobs protects system performance against job size variability. In the second chapter, we study constraint satisfaction problems for a Markovian parallel-server queueing model with impatient customers, motivated by large telephone call centers. To minimize the staffing level subject to different service-level constraints, we propose refined square-root staffing (SRS) rules, which preserve the insightfulness and computational scalability of the celebrated SRS principle and yet achieve a stronger form of optimality. In particular, using asymptotic series expansion techniques, we first develop refinements to a set of asymptotic performance approximations recently used in analyzing large call centers, namely, the Quality and Efficiency Driven (QED) diffusion approximations. We then use the improved performance approximations to explicitly characterize the error of conventional SRS and further obtain the refined SRS rules. Finally, we demonstrate how the explicit form of the staffing refinements enables an analytical assessment of the accuracy of conventional SRS and its underlying QED approximation. In the third chapter, we study a fluid model for many-server Markovian queues in changing environments, which can be used to model large-scale service systems with customer abandonments and time-varying arrivals. We obtain the stationary distribution of the fluid model, which refines and is shown to converge, as the environment changing rate vanishes in a proper way, to a simple discrete bimodal approximation. We also prove that the fluid model arises as a law of large number limit in a many-server asymptotic regime.
APA, Harvard, Vancouver, ISO, and other styles
5

Blanc, Alberto P. "Quality of service guarantees for FIFO queues with constrained inputs." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2006. http://wwwlib.umi.com/cr/ucsd/fullcit?p3230036.

Full text
Abstract:
Thesis (Ph. D.)--University of California, San Diego, 2006.
Title from first page of PDF file (viewed November 17, 2006). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 88-90).
APA, Harvard, Vancouver, ISO, and other styles
6

Brahimi, Mammar. "Approximating multi-server queues with inhomgeneous arrival rates and continuous service time distributions." Thesis, Lancaster University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gao, Xuefeng. "Stochastic models for service systems and limit order books." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50238.

Full text
Abstract:
Stochastic fluctuations can have profound impacts on engineered systems. Nonetheless, we can achieve significant benefits such as cost reduction based upon expanding our fundamental knowledge of stochastic systems. The primary goal of this thesis is to contribute to our understanding by developing and analyzing stochastic models for specific types of engineered systems. The knowledge gained can help management to optimize decision making under uncertainty. This thesis has three parts. In Part I, we study many-server queues that model large-scale service systems such as call centers. We focus on the positive recurrence of piecewise Ornstein-Uhlenbeck (OU) processes and the validity of using these processes to predict the steady-state performance of the corresponding many-server queues. In Part II, we investigate diffusion processes constrained to the positive orthant under infinitesimal changes in the drift. This sensitivity analysis on the drift helps us understand how changes in service capacities at individual stations in a stochastic network would affect the steady-state queue-length distributions. In Part III, we study the trading mechanism known as limit order book. We are motivated by a desire to better understand the interplay among order flow rates, liquidity fluctuation, and optimal executions. The goal is to characterize the temporal evolution of order book shape on the “macroscopic” time scale.
APA, Harvard, Vancouver, ISO, and other styles
8

Tronarp, Otto. "Quality of Service in Ad Hoc Networks by Priority Queuing." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1638.

Full text
Abstract:

The increasing usage of information technology in military affairs raises the need for robust high capacity radio networks. The network will be used to provide several different types of services, for example group calls and situation awareness services. All services have specific demands on packet delays and packet losses in order to be fully functional, and therefore there is a need for a Quality of Service (QoS) mechanism in the network.

In this master thesis we examine the possibility to provide a QoS mechanism in Ad Hoc networks by using priority queues. The study includes two different queuing schemes, namely fixed priority queuing and weighted fair queuing. The performance of the two queuing schemes are evaluated and compared with respect to the ability to provide differentiation in network delay, i.e., provide high priority traffic with lower delays than low priority traffic. The study is mainly done by simulations, but for fixed priority queuing we also derive a analytical approximation of the network delay.

Our simulations show that fixed priority queuing provides a sharp delay differentiation between service classes, while weighted fair queuing gives the ability to control the delay differentiation. One of those queuing schemes alone might not be the best solution for providing QoS, instead we suggest that a combination of them is used.

APA, Harvard, Vancouver, ISO, and other styles
9

Dahm, Martin Verfasser], Daniel [Akademischer Betreuer] [Wentzel, and Torsten Oliver [Akademischer Betreuer] Salge. "Breathing down your neck : the impact of queues on customers using a service / Martin Dahm ; Daniel Wentzel, Torsten Oliver Salge." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1126729736/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dahm, Martin [Verfasser], Daniel [Akademischer Betreuer] Wentzel, and Torsten Oliver [Akademischer Betreuer] Salge. "Breathing down your neck : the impact of queues on customers using a service / Martin Dahm ; Daniel Wentzel, Torsten Oliver Salge." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1126729736/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Service of queues"

1

Statistical Office of the European Communities. Some statistics on services =: Quelques chiffres sur les services. Luxembourg: Office des publications officielles des Communautés européennes, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Québec (Province). Commission d'enquête sur les services de santé et les services sociaux. Les Services de santé et les services sociaux: Quelques pistes de réflexion. [Québec]: Commission d'enquête sur les services de santé et les services sociaux, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beaudet, Pierre R. Small-scale archaeological projects 1987, Canadian Parks Service, Quebec Region. Ottawa, Ont: Environment Canada, Parks Service, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Peter, Russell. At Her Majesty's Service. South Yarmouth, Mass: John Curley, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gagnon, Gérald. Histoire du Service de police de la ville de Québec. Sainte-Foy: Publications du Québec, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bertaux, Roger. Pauvres et marginaux dans la société française: Quelques figures historiques des rapports entre les pauvres, les marginaux et la société française. Paris: Editions L'Harmattan, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bertaux, Roger. Pauvres et marginaux dans la société française: Quelques figures historiques des rapports entre les pauvres, les marginaux et la société française. Nancy: Presses universitaires de Nancy, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Harland, Kathleen. A history of Queen Alexandra's Royal Naval Nursing Service. (s.l.): Journal of the Royal Naval Medical Service, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dussaussois, Guy. Biosis and some natural sciences special libraries in the U.S.A. =: Biosis et quelques bibliothèques américaines de sciences naturelles : rapport d'un voyage d'étude. Bordeaux: [s.n.], 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Canadian Parks Service Reconstruction Workshop (1992 Hull, Québec). Proceedings of the Canadian Parks Service Reconstruction Workshop: Hull, Quebec, 11-13 March 1992. Ottowa, Ont: National Historic Sites, Parks Service, Environment Canada, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Service of queues"

1

Maleyeff, John. "Modeling Business Process Queues." In Service Science, 119–34. Title: Service science : analysis and improvement of business processes / John Maleyeff. Description: New York, NY : Routledge, 2020.: Routledge, 2020. http://dx.doi.org/10.4324/9780429320750-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mansour, Mohamed S., Karsten Schwan, and Sameh Abdelaziz. "I-Queue: Smart Queues for Service Management." In Service-Oriented Computing – ICSOC 2007, 252–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11948148_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alfa, Attahiru S. "Arrival and Service Processes." In Applied Discrete-Time Queues, 23–55. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-3420-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

An, Luna, Mallika Machra, Abigail M. Moser, Sanja Simonovikj, and Richard C. Larson. "Queues in Service Systems: Some Unusual Applications." In Handbook of Service Science, Volume II, 327–48. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98512-1_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kesidis, George. "Discrete-Time Queues with Constant Service Rate." In ATM Network Performance, 19–33. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-4568-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kesidis, George. "Discrete-Time Queues with Constant Service Rate." In ATM Network Performance, 19–39. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4559-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bruneel, Herwig, Wouter Rogiest, Joris Walraevens, and Sabine Wittevrongel. "On Queues with General Service Demands and Constant Service Capacity." In Quantitative Evaluation of Systems, 210–25. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10696-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mohanty, J. R. "Finite Buffer Controllable Single and Batch Service Queues." In Distributed Computing and Internet Technology, 184–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11659-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ponomarov, Vadym, and Eugene Lebedev. "Finite Source Retrial Queues with State-Dependent Service Rate." In Communications in Computer and Information Science, 140–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35980-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gladkov, L. A., N. V. Gladkova, and S. N. Leiba. "Hybrid Intelligent Approach to Solving the Problem of Service Data Queues." In Proceedings of the First International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’16), 421–31. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33609-1_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Service of queues"

1

"The Benefit of Information in a Single-server Queue with Heterogeneous Service Valuations [Abstract]." In InSITE 2019: Informing Science + IT Education Conferences: Jerusalem. Informing Science Institute, 2019. http://dx.doi.org/10.28945/4356.

Full text
Abstract:
Aim/Purpose: How does heterogeneous valuation of service affect optimal control of queues? Background We analyze this heterogeneity by adding a component of travel costs, which differ with distance from the service point. Methodology: Mathematical analysis of queuing theory. Analyzing the anarchy function. Contribution: Enabling consumers to make optimal choices based on knowledge about their status, and enabling better control of the organizer. Findings: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Practitioners: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Researchers: Explore the following points: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points. Impact on Society: Handling queues taking into account social welfare. Future Research: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points.
APA, Harvard, Vancouver, ISO, and other styles
2

Lakhani, Pratibha, and Neela Kane. "SOME NEW ASPECTS OF SERVICE SURRENDER QUEUES." In Annual International Conference on Operations Research and Statistics. Global Science & Technology Forum (GSTF), 2012. http://dx.doi.org/10.5176/2251-1938_ors13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Kan. "Classifications for batch service queues in production systems." In 2014 IEEE International Conference on Automation Science and Engineering (CASE). IEEE, 2014. http://dx.doi.org/10.1109/coase.2014.6899404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anantharam, V., S. Parikh, and P. Varaiya. "Unstable queues with arrival rate less than service rate." In 1985 24th IEEE Conference on Decision and Control. IEEE, 1985. http://dx.doi.org/10.1109/cdc.1985.268728.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Baykal-Gursoy, Melike, and Zhe Duan. "M/M/C queues with Markov modulated service processes." In the 1st international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1190095.1190143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Villen-Altamirano, Jose. "RESTART simulation of networks of queues with Erlang service times." In 2009 Winter Simulation Conference (WSC 2009). IEEE, 2009. http://dx.doi.org/10.1109/wsc.2009.5429635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Wei, R. J. Fretwell, and D. D. Kouvatsos. "Performance analysis of queues with batch Poisson arrival and service." In 2011 IEEE 13th International Conference on Communication Technology (ICCT). IEEE, 2011. http://dx.doi.org/10.1109/icct.2011.6158036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bergamo, Rubem, and Paulo Cardieri. "Maximum Service Rate of Two Interacting Queues with Delay Constraint." In 9th International Conference on Cognitive Radio Oriented Wireless Networks. ICST, 2014. http://dx.doi.org/10.4108/icst.crowncom.2014.255670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hao Wang and Bill Lin. "Succinct priority indexing structures for the management of large priority queues." In 2009 IEEE 17th International Workshop on Quality of Service (IWQoS). IEEE, 2009. http://dx.doi.org/10.1109/iwqos.2009.5201416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Giralte, Luis Campo, Isaac Martin de Diego, Cristina Conde, and Enrique Cabello. "DLimiter: Mitigating Distributed Denial of Service by Using Multiple Discipline Queues." In 2013 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE). IEEE, 2013. http://dx.doi.org/10.1109/icmeae.2013.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Service of queues"

1

Brill, Percy H., and Carl M. Harris. Waiting Times for M/G/1 Queues with Service-Time-Dependent Server Vacations. Fort Belvoir, VA: Defense Technical Information Center, June 1989. http://dx.doi.org/10.21236/ada209597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

De, J. SMTP Service Extension for Remote Message Queue Starting. RFC Editor, August 1996. http://dx.doi.org/10.17487/rfc1985.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Frisancho, Verónica, and Eric Parrado. International Remittances to Latin America and the Caribbean amid the COVID-19 Crisis: A Push for Digitalization? Inter-American Development Bank, December 2021. http://dx.doi.org/10.18235/0003874.

Full text
Abstract:
Remittances constitute a significant safety net for millions of households in Latin America and the Caribbean (LAC). Consequently, changes in international transfers can be a crucial agent of transmission of the COVID-19 induced economic crisis from richer to poorer nations and from urban to rural areas. Relying on data on queries to the search engine Google between December 2018 and July 2021, this study looks at the evolution of demand for in-person versus digital international transfer services and evaluates if take-up rates of different types of service providers trace the initial drop and subsequent rebound of remittances. The recovery of remittances was accompanied by a modest and temporary increase in the interest in digital mechanisms for sending money to home countries, which is accompanied by lower demand for brick-and-mortar service providers.
APA, Harvard, Vancouver, ISO, and other styles
4

Kaboré, Gisele, and Idrissa Kabore. Analyse secondaire des données de l'analyse situationnelle des services de santé de la reproduction. Population Council, 2009. http://dx.doi.org/10.31899/pgy20.1000.

Full text
Abstract:
En début 2002, l’UNFPA a soutenu un projet intitulé Renforcement des services sanitaires et sociaux pour faire face aux besoins de santé sexuelle et reproductive des adolescentes. Le projet avait pour objectif d’améliorer la connaissance des adolescentes mariées en ce qui concerne la législation et leurs propres droits; les éduquer à prendre soin de leur propre santé et de celle de leurs enfants; et augmenter leur accessibilité aux services de santé reproductive, particulièrement dans les régions les plus pauvres du Burkina Faso. Le projet a affirmé que les normes de fonctionnement ne sont pas remplies en termes d’infrastructures, d’équipement, de matériel et de ressources humaines. Les services disponibles ne sont pas bien connus par les populations, ce qui peut limiter la fréquentation. Il apparaît aussi que les services offerts aux adolescents ne sont pas assez développés car peu de prestataires ont des compétences nécessaires. Quelques recommandations ont été formulées en réponses aux problèmes et aux insuffisances constatées, sur la capacité d’offre et la qualité des services.
APA, Harvard, Vancouver, ISO, and other styles
5

White, G., and R. Pan. Active Queue Management (AQM) Based on Proportional Integral Controller Enhanced PIE) for Data-Over-Cable Service Interface Specifications (DOCSIS) Cable Modems. RFC Editor, February 2017. http://dx.doi.org/10.17487/rfc8034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Murray, Olivia. "Outing" Queer Issues in Teacher Preparation Programs: How Pre-Service Teachers Experience Sexual and Gender Diversity in Their Field Placements. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Clavet, Nicholas-James, Réjean Hébert, and Pierre-Carl Michaud. The future of long-term care in Quebec: what are the cost savings from a realistic shift towards more home care? CIRANO, April 2022. http://dx.doi.org/10.54932/zrzh8256.

Full text
Abstract:
This paper aims to estimate the future long-term care needs and expenditures in Quebec while proposing and evaluating a reform package that could deliver increased coverage as well as be more financially sustainable than current policy. This reform package consists of a shift towards more intensive use of home care while increasing public coverage of care needs. A key feature of the proposed reform is to improve the ability of users to choose their provider with the creation of a senior’s care account, an account that grants individuals in need to purchase services from several providers, including both home and institutional care. To improve the neutrality of public support across care arrangements, we also propose to increase residents’ contribution in nursing homes while favoring the continued use of existing tax credits to help seniors with lower needs in terms of care. Using detailed dynamic modelling of care needs, living arrangements, and expenditures, we estimate that long-term care needs will grow rapidly in the next two decades and the costs will quickly become prohibitive under current policy. We show that substantial cost savings may exist.
APA, Harvard, Vancouver, ISO, and other styles
8

Clavet, Nicholas-James, Réjean Hébert, and Pierre-Carl Michaud. The future of long-term care in Quebec: what are the cost savings from a realistic shift towards more home care? CIRANO, April 2022. http://dx.doi.org/10.54932/zrzh8256.

Full text
Abstract:
This paper aims to estimate the future long-term care needs and expenditures in Quebec while proposing and evaluating a reform package that could deliver increased coverage as well as be more financially sustainable than current policy. This reform package consists of a shift towards more intensive use of home care while increasing public coverage of care needs. A key feature of the proposed reform is to improve the ability of users to choose their provider with the creation of a senior’s care account, an account that grants individuals in need to purchase services from several providers, including both home and institutional care. To improve the neutrality of public support across care arrangements, we also propose to increase residents’ contribution in nursing homes while favoring the continued use of existing tax credits to help seniors with lower needs in terms of care. Using detailed dynamic modelling of care needs, living arrangements, and expenditures, we estimate that long-term care needs will grow rapidly in the next two decades and the costs will quickly become prohibitive under current policy. We show that substantial cost savings may exist.
APA, Harvard, Vancouver, ISO, and other styles
9

Sakhare, Rahul Suryakant, Jairaj Desai, Jijo K. Mathew, Woosung Kim, Justin Mahlberg, Howell Li, and Darcy M. Bullock. Evaluating the Impact of Vehicle Digital Communication Alerts on Vehicles. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317324.

Full text
Abstract:
Traditional methods for communicating the presence of maintenance activities and work zones have been done with a variety of fixed signs. The increase of in-vehicle connectivity on our roads—either directly integrated into the vehicle or via an application running on a mobile phone–provides an opportunity for additional communication to motorists about the presence of emergency vehicles, maintenance activities, or work zones. Although the exact form of the in-vehicle communication is evolving and will continue to do so, a critical first step is to leverage the extensive telematics currently deployed on the Indiana Department of Transportation Vehicles. The objective of this study was to conduct trial deployments on a variety of INDOT vehicles, and to begin a dialog with private sector partners about what information INDOT can share that will provide a safer roadway for all motorists, INDOT workers, and INDOT partners. The final design of connected vehicles will likely change considerably over the next few years as market forces determine what type of information is directly integrated into the vehicle and what information is integrated via cell phones. This report identifies several examples where in-vehicle notification alerting drivers to the presence of service and contractor vehicles was acknowledged by drivers. Hard braking data is being used to determine if these alerts have a meaningful impact on safety. Early results indicate substantial reduction in hard braking events (from 29 to 3) between conditions when queue trucks are not used and when they are used. A larger data set is currently being collected with Hoosier Helpers to isolate the impact of the in-vehicle alerts.
APA, Harvard, Vancouver, ISO, and other styles
10

Guía de características y criterios para resolver peticiones, quejas, reclamos, sugerencias, denuncias y felicitaciones. Universidad Militar Nueva Granada, August 2021. http://dx.doi.org/10.18359/docinst.5843.

Full text
Abstract:
El derecho de petición es el derecho fundamental de presentar, por motivos de interés general o particular, solicitudes respetuosas ante cualquier autoridad. Este es un mecanismo de participación y control de gran relevancia que actúa como garantía de otros derechos fundamentales regulados, principalmente, por la Constitución Política de Colombia y la Ley 1755 de 2015. Con el fin de garantizar altos estándares de calidad educativa, y dar cumplimiento a su misión, la Universidad Militar Nueva Granada se interesa por fomentar el dialogo, promover el respeto por los valores y formar ciudadanos íntegros y socialmente responsables. Asimismo, propende garantizar un buen servicio a sus grupos de interés; haciendo énfasis en los principios de celeridad, economía, igualdad, imparcialidad, moralidad, publicidad y transparencia. En ese orden de ideas, la Universidad pone a disposición de toda la comunidad la Guía de características y criterios para resolver peticiones, quejas, reclamos, sugerencias, denuncias y felicitaciones para garantizar que se brinde una atención coherente, oportuna y de calidad.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Service of queues' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography