Functional continuity and large deviations for the behavior of single-class queueing networks

We consider a single-class queueing network in which the functional network primitives describe the cumulative exogenous arrivals, service times and routing decisions of the queues. The behavior of the network consisting of the cumulative total arrival, cumulative idle time, and queue length developments for each node is specified by conditions which relate the network primitives to the network behavior. For a broad class of network primitives, including discrete customer and fluid models, a network behavior exists, but need not be unique. Nevertheless, the mapping from network primitives to the set of associated network behavior is upper semicontinuous at network primitives with continuous routing. As an application we consider a sequence of random network primitives satisfying a sample path large deviation principle. We take advantage of the partial functional set-valued upper semicontinuity in order to derive a large deviation principle for the sequence of associated random queue length processes and to identify the rate function. This extends the results of Puhalskii (Markov Process. Relat. Fields 13(1), 99–136, 2007) about large deviations for the tail probabilities of generalized Jackson networks. Since the analysis is carried out on the doubly-infinite time axis ?, we can directly treat stationary situations.     

Near optimal control of queueing networks over a finite time horizon

We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a policy by which the queueing network tracks the fluid solution. To that end we model the deviations between the queuing and the fluid network in each of the intervals by a multi-class queueing network with some infinite virtual queues. We then keep these deviations stable by an adaptation of a maximum pressure policy. We show that this method is asymptotically optimal when the number of items that is processed and the processing speed increase. We illustrate these results through a simple example of a three stage re-entrant line. Research supported in part by Israel Science Foundation Grant 249/02 and 454/05 and by European Network of Excellence Euro-NGI.     

Stein’s method for diffusive limits of queueing processes

Queueing Systems - Donsker’s theorem is perhaps the most famous invariance principle result for Markov processes. It states that, when properly normalized, a random walk behaves...     

A Douglas–Rachford splitting method for solving equilibrium problems

We propose a splitting method for solving equilibrium problems involving the sum of two bifunctions satisfying standard conditions. We prove that this problem is equivalent to find a zero of the sum of two appropriate maximally monotone operators under a suitable qualification condition. Our algorithm is a consequence of the Douglas–Rachford splitting applied to this auxiliary monotone inclusion. Connections between monotone inclusions and equilibrium problems are studied.     

Tail asymptotics for a generalized two-demand queueing model—a kernel method

In this paper, we consider a generalized two-demand queueing model, the same model studied in Wright (Adv. Appl. Prob., 24, 986–1007, 1992). Using this model, we show how the kernel method can be applied to a two-dimensional queueing system for exact tail asymptotics in the stationary joint distribution and also in the two marginal distributions. We demonstrate in detail how to locate the dominant singularity and how to determine the detailed behavior of the unknown generating function around the dominant singularity for a bivariate kernel, which is much more challenging than the analysis for a one-dimensional kernel. This information is the key for characterizing exact tail asymptotics in terms of asymptotic analysis theory. This approach does not require a determination or presentation of the unknown generating function(s).     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology

This paper addresses the problem of scheduling activities in projects with stochastic activity durations. The aim is to determine for each activity a gate—a time before it the activity cannot begin. Setting these gates is analogous to setting inventory levels in the news vendor problem. The resources required for each activity are scheduled to arrive according to its gate. Since activities’ durations are stochastic, the start and finish time of each activity is uncertain. This fact may lead to one of two outcomes: (1) an activity is ready to start its processing as all its predecessors have finished, but it cannot start because the resources required for it were scheduled to arrive at a later time. (2) The resources required for the activity have arrived and are ready to be used but the activity is not ready to start because of precedence constraints. In the first case we will incur a “holding” cost while in the second case, we will incur a “shortage” cost. Our objective is to set gates so as to minimize the sum of the expected holding and shortage costs. We employ the Cross-Entropy method to solve the problem. The paper describes the implementation of the method, compares its results to various heuristic methods and provides some insights towards actual applications.     

A finite algorithm for ϵ-optimal solutions of adaptive queueing control

In this paper, by introducing a weighted supremum norm, then using non-adaptive approach and backward induction, we suggest an ε-optimal algorithm for the problem of adaptive queueing control. In case of Bernoulli queues, we obtain an ε-optimal cost and a 2ε-optimal policy. Furthermore, a simple inequality is given as an upper bound of the error, which can be used for determining the number of backward induction steps.     

A predictor-corrector smoothing method for second-order cone programming

In this paper, the second order cone programming problem is studied. By introducing a parameter into the Fischer-Burmeister function, a predictor-corrector smoothing Newton method for solving the problem is presented. The proposed algorithm does neither have restrictions on its starting point nor need additional computation which keep the iteration sequence staying in the given neighborhood. Furthermore, the global and the local quadratic convergence of the algorithm are obtained, among others, the local quadratic convergence of the algorithm is established without strict complementarity. Preliminary numerical results indicate that the algorithm is effective.     

A multiresolution method for fitting scattered data on the sphere

In this work, we propose an efficient multiresolution method for fitting scattered data functions on a sphere S, using a tensor product method of periodic algebraic trigonometric splines of order 3 and quadratic polynomial splines defined on a rectangular map of S. We describe the decomposition and reconstruction algorithms corresponding to the polynomial and periodic algebraic trigonometric wavelets. As application of this method, we give an algorithm which allows to compress scattered data on spherelike surfaces. In order to illustrate our results, some numerical examples are presented.     

A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions

In this paper, we present a detailed investigation for the properties of a one-parametric class of SOC complementarity functions, which include the globally Lipschitz continuity, strong semismoothness, and the characterization of their B-subdifferential. Moreover, for the merit functions induced by them for the second-order cone complementarity problem (SOCCP), we provide a condition for each stationary point to be a solution of the SOCCP and establish the boundedness of their level sets, by exploiting Cartesian P-properties. We also propose a semismooth Newton type method based on the reformulation of the nonsmooth system of equations involving the class of SOC complementarity functions. The global and superlinear convergence results are obtained, and among others, the superlinear convergence is established under strict complementarity. Preliminary numerical results are reported for DIMACS second-order cone programs, which confirm the favorable theoretical properties of the method.     

A study of the convergence of and error estimation for the homotopy perturbation method for the Volterra–Fredholm integral equations

In this work the solution of the Volterra–Fredholm integral equations of the second kind is presented. The proposed method is based on the homotopy perturbation method, which consists in constructing the series whose sum is the solution of the problem considered. The problem of the convergence of the series constructed is formulated and a proof of the formulation is given in the work. Additionally, the estimation of the approximate solution errors obtained by taking the partial sums of the series is elaborated on.     

A globally and quadratically convergent method for absolute value equations

We investigate the NP-hard absolute value equation (AVE) Ax−|x|=b, where A is an arbitrary n×n real matrix. In this paper, we propose a smoothing Newton method for the AVE. When the singular values of A exceed 1, we show that this proposed method is globally convergent and the convergence rate is quadratic. Preliminary numerical results show that this method is promising.     

A note on the Douglas–Rachford splitting method for optimization problems involving hypoconvex functions

Recently, the convergence of the Douglas–Rachford splitting method (DRSM) was established for minimizing the sum of a nonsmooth strongly convex function and a nonsmooth hypoconvex function under the assumption that the strong convexity constant \(\beta \) is larger than the hypoconvexity constant \(\omega \). Such an assumption, implying the strong convexity of the objective function, precludes many interesting applications. In this paper, we prove the convergence of the DRSM for the case \(\beta =\omega \), under relatively mild assumptions compared with some existing work in the literature.     

A combined forecast—inventory control procedure for spare parts

This paper examines the performance of two different (s, Q) inventory models, namely a simple and an advanced model, for spare parts in a production plant of a confectionery producer in the Netherlands. The simple approach is more or less standard: the undershoot of the reorder level is not taken into account and the normal distribution is used as the distribution of demand during lead-time. The advanced model takes undershoots into account, differentiates between zero and nonzero demands during lead-time, and utilises the gamma distribution for the demand distribution. Both models are fed with parameters estimated by a procedure that forecasts demand sizes and time between demand occurrences separately (intermittent demand). The results show that the advanced approach yields a service level close to the desired one under many circumstances, while the simple approach is not consistent, in that it leads to much larger inventories in meeting the desired service level for all spare parts.     

A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems

We investigate a semi-smooth Newton method for the numerical solution of optimal control problems subject to differential-algebraic equations (DAEs) and mixed control-state constraints. The necessary conditions are stated in terms of a local minimum principle. By use of the Fischer-Burmeister function the local minimum principle is transformed into an equivalent nonlinear and semi-smooth equation in appropriate Banach spaces. This nonlinear and semi-smooth equation is solved by a semi-smooth Newton method. We extend known local and global convergence results for ODE optimal control problems to the DAE optimal control problems under consideration. Special emphasis is laid on the calculation of Newton steps which are given by a linear DAE boundary value problem. Regularity conditions which ensure the existence of solutions are provided. A regularization strategy for inconsistent boundary value problems is suggested. Numerical illustrations for the optimal control of a pendulum and for the optimal control of discretized Navier-Stokes equations conclude the article.     

A Gauss—Newton method for convex composite optimization

An extension of the Gauss—Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization ofh F under two conditions, namelyh has a set of weak sharp minima,C, and there is a regular point of the inclusionF(x) C. This result extends a similar convergence result due to Womersley (this journal, 1985) which employs the assumption of a strongly unique solution of the composite functionh F. A backtracking line-search is proposed as a globalization strategy. For this algorithm, a global convergence result is established, with a quadratic rate under the regularity assumption.This material is based on research supported by National Science Foundation Grants CCR-9157632 and DMS-9102059, the Air Force Office of Scientific Research Grant F49620-94-1-0036, and the United States—Israel Binational Science Foundation Grant BSF-90-00455.