All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 104

Showing per page

Steady state and scaling limit for a traffic congestion model

Ilie Grigorescu, Min Kang (2010)

ESAIM: Probability and Statistics

In a general model (AIMD) of transmission control protocol (TCP) used in internet traffic congestion management, the time dependent data flow vector x(t) > 0 undergoes a biased random walk on two distinct scales. The amount of data of each component xi(t) goes up to xi(t)+a with probability 1-ζi(x) on a unit scale or down to γxi(t), 0 < γ < 1 with probability ζi(x) on a logarithmic scale, where ζi depends on the joint state of the system x. We investigate the long time behavior, mean field...

Stochastic performance measurement in two-stage network processes: A data envelopment analysis approach

Alireza Amirteimoori, Saber Mehdizadeh, Sohrab Kordrostami (2022)

Kybernetika

In classic data envelopment analysis models, two-stage network structures are studied in cases in which the input/output data set are deterministic. In many real applications, however, we face uncertainty. This paper proposes a two-stage network DEA model when the input/output data are stochastic. A stochastic two-stage network DEA model is formulated based on the chance-constrained programming. Linearization techniques and the assumption of single underlying factor of the data are used to construct...

Stochastic queue core problem with an efficient length on a tree network

Jafar Fathali, Mehdi Zaferanieh (2025)

Kybernetika

In this paper, we consider a stochastic queue core ( S Q C ) problem on a tree network, aiming to identify a path P , called the core, in an M / G / 1 environment system. Let T be a tree network, the S Q C problem on T involves finding a core P , with an optimal length, that minimizes the total weighted travel time from all vertices to the core as well as the average response time to the customer demands. We assume that a mobile server traverses the core to provide services to customers, while customers move to their...

Strategies for LP-based solving a general class of scheduling problems.

Laureano F. Escudero, Gloria Pérez Sáinz de Rozas (1990)

Trabajos de Investigación Operativa

In this work we describe some strategies that have been proved to be very efficient for solving the following type of scheduling problems: Assume a set of jobs is to be performed along a planning horizon by selecting one from several alternatives for doing so. Besides selecting the alternative for each job, the target consists of choosing the periods at which each component of the work will be done, such that a set of scheduling and technological constraints is satisfied. The problem is formulated...

Sur les α -flots

W. Bienia, V. Letrouit (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Currently displaying 81 – 100 of 104