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 68 Next

Displaying 1341 – 1360 of 1566

Showing per page

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

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)

Annales de l'institut Fourier

In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an n -dimensional hypercube in the circuit switched, Δ -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...

Synchronized traffic plans and stability of optima

Marc Bernot, Alessio Figalli (2008)

ESAIM: Control, Optimisation and Calculus of Variations

The irrigation problem is the problem of finding an efficient way to transport a measure μ+ onto a measure μ-. By efficient, we mean that a structure that achieves the transport (which, following [Bernot, Caselles and Morel, Publ. Mat.49 (2005) 417–451], we call traffic plan) is better if it carries the mass in a grouped way rather than in a separate way. This is formalized by considering costs functionals that favorize this property. The aim of this paper is to introduce a dynamical cost functional...

Tarification par des jeux coopératifs avec demandes élastiques

F. Bendali, J. Mailfert, A. Quilliot (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Nous proposons ici un modèle de Tarification basé sur une extension du formalisme des Jeux Coopératifs et qui prend en compte la notion d’Élasticité de la Demande. Nous présentons pour ce modèle un résultat d’existence ainsi qu’un algorithme de calcul associé. Nous interprétons enfin ce nouveau concept dans le cas d’un problème de production et nous le prolongeons au cas d’un problème de transport.

Tarification par des jeux Coopératifs avec Demandes Élastiques

F. Bendali, J. Mailfert, A. Quilliot (2010)

RAIRO - Operations Research

We propose here a pricing Model which is an extension of the Cooperative Game concept and which includes a notion of Elastic Demand. We present some existence results as well as some algorithms. We conclude by discussing this model in the context of some Production and Transportation problems.

Currently displaying 1341 – 1360 of 1566