Journal: RAIRO - Operations Research

Found 160 papers in total
Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision‐making
Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision‐making
2012,
In this paper, we develop a supply chain network equilibrium model in which electronic...
Interactive compromise hypersphere method and its applications
Interactive compromise hypersphere method and its applications
2012,
The paper focuses on multi‐criteria problems. It presents the interactive...
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
2012,
In this paper, a batch arrival general bulk service queueing system with interrupted...
Metasearch information fusion using linear programming
Metasearch information fusion using linear programming
2012,
For a specific query merging the returned results from multiple search engines, in the...
A heuristic column generation method for the heterogeneous fleet VRP
A heuristic column generation method for the heterogeneous fleet VRP
1999,
This paper presents a heuristic column generation method for solving vehicle routing...
On the hierarchy of functioning rules in distributed computing
On the hierarchy of functioning rules in distributed computing
1999,
In previous papers, we used a Markovian model to determine the optimal functioning...
A good approximation of the inventory level in a (Q, r) perishable inventory system
A good approximation of the inventory level in a (Q, r) perishable inventory system
1999,
This paper derives a good approach to approximating the expected inventory level per...
Contrôle dynamique de flux dans un système d'attente avec panne
Contrôle dynamique de flux dans un système d'attente avec panne
1999,
We consider two parallel M/M/1 queues. The server at one of the queues is subject to...
A new formulation for scheduling unrelated processor under precedence constraints
A new formulation for scheduling unrelated processor under precedence constraints
1999,
We give a new formulation for the problem of task scheduling into unrelated processors...
Automatic run‐time choice for simulation length in mimesis
Automatic run‐time choice for simulation length in mimesis
1999,
This paper presents an algorithm which prevents a simulation user from choosing a...
Greedy algorithms for optimal computing of matrix chain products involving square denseand triangular matrices
Greedy algorithms for optimal computing of matrix chain products involving square denseand triangular matrices
2011,
This paper addresses a combinatorial optimization problem (COP), namely a variant of...
Computational schemes for two exponential servers where the first has a finite buffer
Computational schemes for two exponential servers where the first has a finite buffer
2011,
We consider a system consisting of two not necessarily identical exponential servers...
Balancing the stations of a self service ‘bike hire’ system
Balancing the stations of a self service ‘bike hire’ system
2011,
This paper is motivated by operating self service transport systems that flourish...
Flexible measures in production process: A DEA‐based approach
Flexible measures in production process: A DEA‐based approach
2011,
Data envelopment analysis (DEA) has been proven as an excellent data‐oriented...
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
2011,
In this paper we analyze a known relaxation for the Sparsest Cut problem based on...
A hybrid genetic algorithm for a dynamic logistics network with multi‐commodities and components
A hybrid genetic algorithm for a dynamic logistics network with multi‐commodities and components
2011,
Various topics related to reverse logistics have been discussed over the years. Most...
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service
2011,
This paper concerns a discrete time Geo [X] /G/1 retrial queue with general retrial...
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
2011,
In this paper we deal with the preemptive asymmetric stacker crane problem in a...
Minmax regret combinatorial optimization problems: an AlgorithmicPerspective
Minmax regret combinatorial optimization problems: an AlgorithmicPerspective
2011,
Uncertainty in optimization is not a new ingredient. Diverse models considering...
Algorithms for recognizing bipartite‐Helly and bipartite‐conformal hypergraphs
Algorithms for recognizing bipartite‐Helly and bipartite‐conformal hypergraphs
2011,
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise...
Some aspects of balking and reneging in finite buffer queues
Some aspects of balking and reneging in finite buffer queues
2011,
In this paper, a single server finite buffer Markovian queuing system is analyzed with...
A survey on combinatorial optimization in dynamic environments
A survey on combinatorial optimization in dynamic environments
2011,
This survey presents major results and issues related to the study of NPO problems in...
On the complexity of problems on simple games
On the complexity of problems on simple games
2011,
Simple games cover voting systems in which a single alternative, such as a bill or an...
On designing connected rapid transit networks reducing the number of transfers
On designing connected rapid transit networks reducing the number of transfers
2011,
In this paper we introduce some improvements on an approach that we described...
Papers per page: