STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES

2015 ◽  
Vol 30 (1) ◽  
pp. 41-60 ◽  
Author(s):  
Amin Dehghanian ◽  
Jeffrey P. Kharoufeh ◽  
Mohammad Modarres
Keyword(s):  
Poisson Process ◽  
Sojourn Time ◽  
Queueing System ◽  
The Other ◽  
Infinite Time ◽  
Numerical Examples ◽  
Parallel Queues ◽  
Time Horizons ◽  
Holding Cost ◽  
Shortest Queue

Consider a two-station, heterogeneous parallel queueing system in which each station operates as an independent M/M/1 queue with its own infinite-capacity buffer. The input to the system is a Poisson process that splits among the two stations according to a Bernoulli splitting mechanism. However, upon arrival, a strategic customer initially joins one of the queues selectively and decides at subsequent arrival and departure epochs whether to jockey (or switch queues) with the aim of reducing her own sojourn time. There is a holding cost per unit time, and jockeying incurs a fixed non-negative cost while placing the customer at the end of the other queue. We examine individually optimal joining and jockeying policies that minimize the strategic customer's total expected discounted (or undiscounted) costs over finite and infinite time horizons. The main results reveal that, if the strategic customer is in station 1 with ℓ customers in front of her, and q1 and q2 customers in stations 1 and 2, respectively (excluding herself), then the incentive to jockey increases as either ℓ increases or q2 decreases. Numerical examples reveal that it may not be optimal to join, and/or jockey to, the station with the shortest queue or the fastest server.

scholarly journals Universality of load balancing schemes on the diffusion scale

2016 ◽  
Vol 53 (4) ◽  
pp. 1111-1124 ◽  
Author(s):  
Debankur Mukherjee ◽  
Sem C. Borst ◽  
Johan S. H. van Leeuwaarden ◽  
Philip A. Whiting
Keyword(s):  
Load Balancing ◽  
Poisson Process ◽  
Heavy Traffic ◽  
Diffusion Limit ◽  
Parallel Queues ◽  
Special Cases ◽  
Service Rates ◽  
Join The Shortest Queue ◽  
Shortest Queue ◽  
Diffusion Scale

Abstract We consider a system of N parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among d randomly selected servers otherwise (1≤d≤N). This load balancing scheme subsumes the so-called join-the-idle queue policy (d=1) and the celebrated join-the-shortest queue policy (d=N) as two crucial special cases. We develop a stochastic coupling construction to obtain the diffusion limit of the queue process in the Halfin‒Whitt heavy-traffic regime, and establish that it does not depend on the value of d, implying that assigning tasks to idle servers is sufficient for diffusion level optimality.

scholarly journals Hybrid Bernstein Block-Pulse Functions Method for Second Kind Integral Equations with Convergence Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Convergence Analysis ◽  
Bernstein Polynomials ◽  
Linear Equations ◽  
The Other ◽  
New Combination ◽  
System Of Linear Equations ◽  
Numerical Examples ◽  
Block Pulse Functions

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.

scholarly journals On Existence of Stabilizing Switching Laws within a Class of Unstable Linear Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Sendren Sheng-Dong Xu ◽  
Chih-Chiang Chen
Keyword(s):  
Control Systems ◽  
Linear Systems ◽  
Switched Systems ◽  
The Other ◽  
Linear Control ◽  
Linear Control Systems ◽  
Problem Statement ◽  
Theoretical Derivation ◽  
Control Laws ◽  
Numerical Examples

The equivalence of two conditions, condition (3) and condition (4) stated in Problem Statement section, regarding the existence of stabilizing switching laws between two unstable linear systems first appeared in (Feron 1996). Although Feron never published this result, it has been referenced in almost every survey on switched systems; see, for example, (Liberzon and Morse 1999). This paper proposes another way to prove the equivalence of two conditions regarding the existence of stabilizing switching laws between two unstable linear systems. One is effective for theoretical derivation, while the other is implementable, and a class of stabilizing switching laws have been explicitly constructed by Wicks et al. (1994). With the help of the equivalent relation, a condition for the existence of controllers and stabilizing switching laws between two unstabilizable linear control systems is then proposed. Then, the study is further extended to the issue concerning the construction of quadratically stabilizing switching laws among unstable linear systems and unstabilizable linear control systems. The obtained results are employed to study the existence of control laws and quadratically stabilizing switching laws within a class of unstabilizable linear control systems. The numerical examples are illustrated and simulated to show the feasibility and effectiveness of the proposed methods.

A Friendly Iterative Technique for Solving Nonlinear Integro-Differential and Systems of Nonlinear Integro-Differential Equations

2018 ◽  
Vol 15 (03) ◽  
pp. 1850016 ◽  
Author(s):  
A. A. Hemeda
Keyword(s):  
Approximate Solution ◽  
Differential Operator ◽  
Differential Equations ◽  
The Other ◽  
Iterative Technique ◽  
Restrictive Assumption ◽  
Numerical Examples ◽  
Linear And Nonlinear ◽  
Computational Procedures ◽  
Adomian’S Polynomials

In this work, a simple new iterative technique based on the integral operator, the inverse of the differential operator in the problem under consideration, is introduced to solve nonlinear integro-differential and systems of nonlinear integro-differential equations (IDEs). The introduced technique is simpler and shorter in its computational procedures and time than the other methods. In addition, it does not require discretization, linearization or any restrictive assumption of any form in providing analytical or approximate solution to linear and nonlinear equations. Also, this technique does not require calculating Adomian’s polynomials, Lagrange’s multiplier values or equating the terms of equal powers of the impeding parameter which need more computational procedures and time. These advantages make it reliable and its efficiency is demonstrated with numerical examples.

The Mechanical Performance Evaluation of a Mechanism with Curved Edge Driving Component

2013 ◽  
Vol 834-836 ◽  
pp. 1290-1294
Author(s):  
Xin Qin Liu
Keyword(s):  
Performance Evaluation ◽  
Fast Moving ◽  
Mechanical Performance ◽  
Gain Coefficient ◽  
The Other ◽  
Force Transmission ◽  
Transmission Performance ◽  
Connecting Rod ◽  
Numerical Examples ◽  
Straight Line

Mechanicalmethods were employed to study the motion and force transmission performance ofa kind of connecting rod slider mechanism with a curved edge driving component.The deduction methods and the computation formulae of the slider displacement,velocity, acceleration and the executive force gain coefficient were given.Considering two cases of the driving components with straight line edge andexponential function edge, the numerical examples was computed respectively,the results show that the former one is suitable for the force transmission andcan be used in the grip design and the other one is suitable for the motiontransmission which can be used in the fast moving mechanism

INDIVIDUAL EQUILIBRIUM DYNAMIC ROUTING IN A MULTIPLE SERVER RETRIAL QUEUE

2000 ◽  
Vol 14 (1) ◽  
pp. 9-26 ◽  
Author(s):  
Anthony C. Brooms
Keyword(s):  
Nash Equilibrium ◽  
Poisson Process ◽  
Sojourn Time ◽  
Service System ◽  
Transmission Rate ◽  
Retrial Queue ◽  
Dynamic Learning ◽  
Arrival Times ◽  
The Public ◽  
Expected Sojourn Time

Customers arrive sequentially to a service system where the arrival times form a Poisson process of rate λ. The system offers a choice between a private channel and a public set of channels. The transmission rate at each of the public channels is faster than that of the private one; however, if all of the public channels are occupied, then a customer who commits itself to using one of them attempts to connect after exponential periods of time with mean μ−1. Once connection to a public channel has been made, service is completed after an exponential period of time, with mean ν−1. Each customer chooses one of the two service options, basing its decision on the number of busy channels and reapplying customers, with the aim of minimizing its own expected sojourn time. The best action for an individual customer depends on the actions taken by subsequent arriving customers. We establish the existence of a unique symmetric Nash equilibrium policy and show that its structure is characterized by a set of threshold-type strategies; we discuss the relevance of this concept in the context of a dynamic learning scenario.

scholarly journals Optical axes of catadioptric systems including visual, Purkinje and other nonvisual systems of a heterocentric astigmatic eye

2010 ◽  
Vol 69 (3) ◽  
Author(s):  
W. F. Harris
Keyword(s):  
Visual System ◽  
Optical Axis ◽  
The Other ◽  
Optical Systems ◽  
Numerical Examples ◽  
Straight Line ◽  
Optical Axes ◽  
Catadioptric Systems ◽  
Reflecting Surfaces ◽  
Special Case

For a dioptric system with elements which may be heterocentric and astigmatic an optical axis has been defined to be a straight line along which a ray both enters and emerges from the system.  Previous work shows that the dioptric system may or may not have an optical axis and that, if it does have one, then that optical axis may or may not be unique.  Formulae were derived for the locations of any optical axes.  The purpose of this paper is to extend those results to allow for reflecting surfaces in the system in addition to refracting elements.  Thus the paper locates any optical axes in catadioptric systems (including dioptric systems as a special case).  The reflecting surfaces may be astigmatic and decentred or tilted.  The theory is illustrated by means of numerical examples.  The locations of the optical axes are calculated for seven optical systems associated with a particular heterocentric astigmatic model eye.  The optical systems are the visual system, the four Purkinje systems and two other nonvisual systems of the eye.  The Purkinje systems each have an infinity of optical axes whereas the other nonvisual systems, and the visual system, each have a unique optical axis. (S Afr Optom 2010 69(3) 152-160)

Analysis of the M x/G/1 queue by N-policy and multiple vacations

1994 ◽  
Vol 31 (02) ◽  
pp. 476-496
Author(s):  
Ho Woo Lee ◽  
Soon Seok Lee ◽  
Jeong Ok Park ◽  
K. C. Chae
Keyword(s):  
Performance Measures ◽  
Queue Length ◽  
Time Distribution ◽  
Queueing System ◽  
Random Variables ◽  
System Size ◽  
The Other ◽  
Waiting Time Distribution ◽  
Multiple Vacations ◽  
Linear Cost

We consider an Mx /G/1 queueing system with N-policy and multiple vacations. As soon as the system empties, the server leaves for a vacation of random length V. When he returns, if the queue length is greater than or equal to a predetermined value N(threshold), the server immediately begins to serve the customers. If he finds less than N customers, he leaves for another vacation and so on until he finally finds at least N customers. We obtain the system size distribution and show that the system size decomposes into three random variables one of which is the system size of ordinary Mx /G/1 queue. The interpretation of the other random variables will be provided. We also derive the queue waiting time distribution and other performance measures. Finally we derive a condition under which the optimal stationary operating policy is achieved under a linear cost structure.

Consistent Hashin-Shtrikman Bounds on the Effective Properties of Periodic Composite Materials

1999 ◽  
Vol 66 (4) ◽  
pp. 858-866
Author(s):  
P. Bisegna ◽  
R. Luciano
Keyword(s):  
Composite Materials ◽  
Saddle Point ◽  
Variational Principles ◽  
Effective Properties ◽  
The Other ◽  
Constitutive Behavior ◽  
Homogenization Problem ◽  
Numerical Examples ◽  
Periodic Composites ◽  
Periodic Composite

In this paper the four classical Hashin-Shtrikman variational principles, applied to the homogenization problem for periodic composites with a nonlinear hyperelastic constitutive behavior, are analyzed. It is proved that two of them are indeed minimum principles while the other two are saddle point principles. As a consequence, every approximation of the former ones provide bounds on the effective properties of composite bodies, while approximations of the latter ones may supply inconsistent bounds, as it is shown by two numerical examples. Nevertheless, the approximations of the saddle point principles are expected to provide better estimates than the approximations of the minimum principles.

scholarly journals Recursive Calculation of Survival Probabilities

1991 ◽  
Vol 21 (2) ◽  
pp. 199-221 ◽  
Author(s):  
David C. M. Dickson ◽  
Howard R. Waters
Keyword(s):  
Finite Time ◽  
Approximate Calculation ◽  
Risk Model ◽  
Classical Risk Model ◽  
Infinite Time ◽  
Numerical Examples ◽  
Survival Probabilities ◽  
Recursive Calculation ◽  
The Stability ◽  
The Classical Risk Model

AbstractIn this paper we present an algorithm for the approximate calculation of finite time survival probabilities for the classical risk model. We also show how this algorithm can be applied to the calculation of infinite time survival probabilities. Numerical examples are given and the stability of the algorithms is discussed.

Sign in / Sign up

Export Citation Format

Share Document