Journal: RAIRO Operations Research

Found 507 papers in total
Comparing classification tree structures: a special case of comparing q-ary relations
Comparing classification tree structures: a special case of comparing q-ary relations
1999,
Comparing q-ary relations on a set Q of elementary objects is one of the most...
Resource allocation in a mobile telephone network: A constructive repair algorithm
Resource allocation in a mobile telephone network: A constructive repair algorithm
2001,
To cope with its development, a French operator of mobile telephone network must...
On the parallel complexity of the alternating Hamiltonian cycle problem
On the parallel complexity of the alternating Hamiltonian cycle problem
1999,
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its...
Structural symmetrics in Petri nets and the reduced reachability graph
Structural symmetrics in Petri nets and the reduced reachability graph
2000,
The main purpose of this paper is to give a method for construction of the reduced...
Comparing classification tree structures: a special case of comparing q-ary relations, part II
Comparing classification tree structures: a special case of comparing q-ary relations, part II
2000,
Comparing q-ary relations on a set Q of elementary objects is one of the most...
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
2001,
A branch-and-bound method for solving the min cut with size constraint problem is...
Primal–dual approximation algorithms for a packing–covering pair of problems
Primal–dual approximation algorithms for a packing–covering pair of problems
2002,
We consider a special packing–covering pair of problems. The packing problem is...
Graph colouring: fundamentals and applications
Graph colouring: fundamentals and applications
2003,
The classical colouring models are well known thanks in large part to their...
Constrained Steiner trees in Halin graphs
Constrained Steiner trees in Halin graphs
2003,
In this paper, we study the problem of computing a minimum cost Steiner tree subject...
Minimum convex-cost tension problems on series-parallel graphs
Minimum convex-cost tension problems on series-parallel graphs
2003,
We present briefly some results we obtained with known methods to solve minimum cost...
Optimal quality of service control of interacting service stations
Optimal quality of service control of interacting service stations
2002,
We consider a system of three queues and two types of packets. Each packet arriving at...
Extension of stochastic dominance theory to random variables
Extension of stochastic dominance theory to random variables
1999,
In this paper, we develop some stochastic dominance theorems for the location and...
Coupling a genetic algorithm and a simulation model for the short-term control of a chemical process
Coupling a genetic algorithm and a simulation model for the short-term control of a chemical process
1999,
In this paper, a discrete-event simulation model is coupled with a genetic algorithm...
The complexity of short schedules for unit execution time bipartite graphs
The complexity of short schedules for unit execution time bipartite graphs
1999,
We show that the problem of deciding is there is a schedule of length three for the...
Optimal scheduling of the 3-machine assembly-type flow shop
Optimal scheduling of the 3-machine assembly-type flow shop
1999,
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This...
An exact method for solving the multi-processor flow-shop
An exact method for solving the multi-processor flow-shop
2000,
The aim of this paper is to present a new branch and bound method for solving the...
A parallel algorithm using both Monte-Carlo and quasi-Monte-Carlo techniques, and an application to queueing networks
A parallel algorithm using both Monte-Carlo and quasi-Monte-Carlo techniques, and an application to queueing networks
2000,
We propose a parallel algorithm which uses both Monte-Carlo and quasi-Monte-Carlo...
Scheduling unit execution and communication trees with communication delays on two processors
Scheduling unit execution and communication trees with communication delays on two processors
2000,
In this paper, we present a new linear time algorithm for scheduling UECT (Unit...
A tabu method for the problem of scheduling tasks on processors in the presence of communication delays
A tabu method for the problem of scheduling tasks on processors in the presence of communication delays
2000,
This paper deals with the problem of scheduling n tasks on m identical processors in...
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
2002,
We consider the unit execution time unit communication time (UET-UCT) scheduling model...
Scheduling multiprocessor tasks on two parallel processors
Scheduling multiprocessor tasks on two parallel processors
2002,
In this work scheduling multiprocessor tasks on two parallel identical processors is...
Scheduling jobs in open shops with limited machine availability
Scheduling jobs in open shops with limited machine availability
2002,
In this paper, open shop scheduling problems with limited machine availability are...
Parallel machine scheduling with uncertain communication delays
Parallel machine scheduling with uncertain communication delays
2003,
This paper is concerned with scheduling when the data are not fully known before the...
Scheduling precedence task graphs with disturbances
Scheduling precedence task graphs with disturbances
2003,
In this paper we consider the problem of scheduling precedence task graphs in parallel...
Papers per page: