Journal: RAIRO - Operations Research

Found 160 papers in total
From Eckart and Young approximation to Moreau envelopes and vice versa
From Eckart and Young approximation to Moreau envelopes and vice versa
2013,
In matricial analysis, the theorem of Eckart and Young provides a best approximation...
Producing the tangency portfolio as a corner portfolio
Producing the tangency portfolio as a corner portfolio
2013,
One‐fund theorem states that an efficient portfolio in a Mean‐Variance...
How to eliminate non‐positive circuits in periodic scheduling: a proactive strategy based on shortest path equations
How to eliminate non‐positive circuits in periodic scheduling: a proactive strategy based on shortest path equations
2013,
Usual periodic scheduling problems deal with precedence constraints having...
Delegation equilibrium payoffs in integer‐splitting games
Delegation equilibrium payoffs in integer‐splitting games
2013,
This work studies a new strategic game called delegation game. A delegation game is...
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
2013,
For solving linear complementarity problems LCP more attention has recently been paid...
Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
2013,
We consider the scheduling of an interval order precedence graph of unit execution...
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS
2013,
Tree decomposition introduced by Robertson and Seymour aims to decompose a problem...
Optimal Allocation of Renewable Energy Parks: A Two–stage Optimization Model
Optimal Allocation of Renewable Energy Parks: A Two–stage Optimization Model
2013,
Applied research into Renewable Energies raises complex challenges of a technological,...
Solving the Crop Allocation Problem using Hard and Soft Constraints
Solving the Crop Allocation Problem using Hard and Soft Constraints
2013,
Application tools for the crop allocation problem (CAP) are required for agricultural...
Time–dependent Simple Temporal Networks: Properties and Algorithms
Time–dependent Simple Temporal Networks: Properties and Algorithms
2013,
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance...
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic
2013,
In this paper we present a new approach to solve the Minimum Independent Dominating...
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
2013,
This note is concerned with the bicriteria scheduling problem on a...
An M X/G/1 unreliable retrial queue with two phase service and persistence behaviour of customers in service
An M X/G/1 unreliable retrial queue with two phase service and persistence behaviour of customers in service
2013,
This paper describes an unreliable server batch arrival retrial queue with two types...
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP‐based lower and upper bounds
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP‐based lower and upper bounds
2013,
This paper considers the problem of scheduling n jobs on a single machine. A fixed...
Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences
Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences
2000,
In this work we propose a ranking procedure. This procedure uses an ordinal...
Modelling integer linear programs with petri nets
Modelling integer linear programs with petri nets
2000,
We show in this paper that timed Petri nets, with one resource shared by all the...
Les problèmes d'ordonnancement de type flow‐shop hybride :état de l'art
Les problèmes d'ordonnancement de type flow‐shop hybride :état de l'art
1999,
A special class of scheduling problems is studied in this paper, named Hybrid...
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
1999,
We propose a temporal decomposition approach for the one‐machine scheduling...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999,
Constructive heuristics for shop scheduling problems are often based on priority (or...
Redinv‐SA: la simulated annealingfor the quadratic assignment problem
Redinv‐SA: la simulated annealingfor the quadratic assignment problem
1999,
An algebraic and combinatorial approach to the study of the Quadratic Assignment...
Linear optimizationwith multiple equitable criteria
Linear optimizationwith multiple equitable criteria
1999,
The standard multiple criteria optimization starts with an assumption that the...
Un couplage entre un algorithme génétiqueet un modèle de simulation pour l'ordonnancement à court termed'un atelier discontinu de chimie fine
Un couplage entre un algorithme génétiqueet un modèle de simulation pour l'ordonnancement à court termed'un atelier discontinu de chimie fine
1999,
In this paper, a discrete‐event simulation model is coupled with a genetic...
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 𝒪 of elementary objects is one of the...
The complexity of short schedulesfor uet bipartite graphs
The complexity of short schedulesfor uet bipartite graphs
1999,
We show that the problem of deciding if there is a schedule of length three for the...
Papers per page: