The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags (2008)
Artigues, Christian, Briand, Cyril
This paper considers the resource-constrained activity insertion problem with minimum and maximum time lags. The problem consists in inserting a single activity in a partial schedule while preserving...
The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags (2008)
Artigues, Christian, Briand, Cyril
This paper considers the resource-constrained activity insertion problem with minimum and maximum time lags. The problem consists in inserting a single activity in a partial schedule while preserving...
Bontoux, Boris, Feillet, Dominique, Artigues, Christian, Bourreau, Eric
In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of...
Bontoux, Boris, Feillet, Dominique, Artigues, Christian, Bourreau, Eric
In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of...
Gacias, Bernat, Artigues, Christian, Lopez, Pierre
We present a large neighborhood search method based on limited discrepancy search to solve a parallel machine scheduling problem with precedence constraints and sequence-dependent setup times. New...
Gacias, Bernat, Artigues, Christian, Lopez, Pierre
We present a large neighborhood search method based on limited discrepancy search to solve a parallel machine scheduling problem with precedence constraints and sequence-dependent setup times. New...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Models and methods for frequency assignment with cumulative interference constraints (2008)
Palpant, Mireille, Oliva, Cristian, Artigues, Christian, Michelon, Philippe, Didi Biha, Mohamed
In this paper, a realistic modeling of interferences for frequency assignment in hertzian telecommunication networks is presented. In contrast with traditional interference models based only on...
Models and methods for frequency assignment with cumulative interference constraints (2008)
Palpant, Mireille, Oliva, Cristian, Artigues, Christian, Michelon, Philippe, Didi Biha, Mohamed
In this paper, a realistic modeling of interferences for frequency assignment in hertzian telecommunication networks is presented. In contrast with traditional interference models based only on...
The Dynamic Frequency Assignment Problem (2008)
Dupont, Audrey, Linhares, Andréa, Artigues, Christian, Feillet, Dominique, Michelon, Philippe, Vasquez, Michel
In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring...
The Dynamic Frequency Assignment Problem (2008)
Dupont, Audrey, Linhares, Andréa, Artigues, Christian, Feillet, Dominique, Michelon, Philippe, Vasquez, Michel
In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring...
Gacias, Bernat, Artigues, Christian, Lopez, Pierre
Cet article concerne l'étude de différentes méthodes de résolution pour les problèmes d'ordonnancement d'opérations sur machines parallèles avec contraintes de précédence et temps de...
Gacias, Bernat, Artigues, Christian, Lopez, Pierre
Cet article concerne l'étude de différentes méthodes de résolution pour les problèmes d'ordonnancement d'opérations sur machines parallèles avec contraintes de précédence et temps de...
Vehicle routing problems with alternative paths: an application to on-demand transportation (2008)
Garaix, Thierry, Artigues, Christian, Feillet, Dominique, Josselin, Didier
The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a...
Vehicle routing problems with alternative paths: an application to on-demand transportation (2008)
Garaix, Thierry, Artigues, Christian, Feillet, Dominique, Josselin, Didier
The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a...
Bontoux, Boris, Artigues, Christian, Feillet, Dominique
The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), in which the set of nodes is divided into mutually exclusive clusters. The...
Bontoux, Boris, Artigues, Christian, Feillet, Dominique
The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), in which the set of nodes is divided into mutually exclusive clusters. The...
Large Neighborhood Search for Variants of TSP (2008)
Bontoux, Boris, Feillet, Dominique, Artigues, Christian
To solve problems with Local Search procedures, neighborhoods have to be defined. During the resolution, a solution is typically replaced by the best solution found in its neighborhood. A question...
Large Neighborhood Search for Variants of TSP (2008)
Bontoux, Boris, Feillet, Dominique, Artigues, Christian
To solve problems with Local Search procedures, neighborhoods have to be defined. During the resolution, a solution is typically replaced by the best solution found in its neighborhood. A question...
Bontoux, Boris, Feillet, Dominique, Artigues, Christian, Bourreau, Eric
In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin
We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint...
Bontoux, Boris, Feillet, Dominique, Artigues, Christian, Bourreau, Eric
In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin
We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint...
A branch and bound method for the job-shop problem with sequence-dependent setup times (2007)
Artigues, Christian, Feillet, Dominique
This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on...
Ordonnancement sous contraintes d'énergie et de ressources humaines (2007)
Hait, Alain, Artigues, Christian, Trépanier, Martin, Baptiste, Pierre
Ce travail s'intéresse à l'ordonnancement dans un atelier de fonderie. Il s'inspire du cas d'une usine de fabrication de tubes. La spécificité de cet exemple vient d'un objectif et de contraintes...
Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems (2007)
Aloulou, Mohamed Ali, Artigues, Christian
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active...
Ordonnancement sous contraintes d'énergie et de ressources humaines (2007)
Hait, Alain, Artigues, Christian, Trépanier, Martin, Baptiste, Pierre
Ce travail s'intéresse à l'ordonnancement dans un atelier de fonderie. Il s'inspire du cas d'une usine de fabrication de tubes. La spécificité de cet exemple vient d'un objectif et de contraintes...
Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems (2007)
Aloulou, Mohamed Ali, Artigues, Christian
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active...
A branch and bound method for the job-shop problem with sequence-dependent setup times (2007)
Artigues, Christian, Feillet, Dominique
This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on...
The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags (2007)
Artigues, Christian, Briand, Cyril
We define the resource-constrained activity insertion problem with minimum and maximum time lags. The problem aims at inserting a single activity in a partial schedule while preserving its structure...
The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags (2007)
Artigues, Christian, Briand, Cyril
We define the resource-constrained activity insertion problem with minimum and maximum time lags. The problem aims at inserting a single activity in a partial schedule while preserving its structure...
Thierry Garaix;, Didier Josselin, Dominique Feillet, Christian Artigues, Élodie Castex
Il s’agit dans cet article d’innover dans les transports à la demande (TAD) en développant une méthode efficace et robuste d’optimisation de tournées en zone rurale peu dense (Pays du Doubs...
Garaix, Thierry, Josselin, Didier, Feillet, Dominique, Artigues, Christian, Castex, Elodie
Il sagit dans cet article dinnover dans les transports à la demande (TAD) en développant une méthode efficace et robuste doptimisation de tournées en zone rurale peu dense (Pays du Doubs...
Garaix, Thierry, Josselin, Didier, Feillet, Dominique, Artigues, Christian, Castex, Elodie
Il sagit dans cet article dinnover dans les transports à la demande (TAD) en développant une méthode efficace et robuste doptimisation de tournées en zone rurale peu dense (Pays du Doubs...
Thierry Garaix;, Didier Josselin, Dominique Feillet, Christian Artigues, Élodie Castex
Il s’agit dans cet article d’innover dans les transports à la demande (TAD) en développant une méthode efficace et robuste d’optimisation de tournées en zone rurale peu dense (Pays du Doubs...
Aloulou, Mohamed Ali, Artigues, Christian
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to...
Aloulou, Mohamed Ali, Artigues, Christian
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to...
Aloulou, Mohamed Ali, Artigues, Christian
On considère le problème de pilotage d'atelier en temps réel et on propose de construire d'une façon procative une solution présentant de la flexibilité séquentielle pouvant être exploitée...
Aloulou, Mohamed Ali, Artigues, Christian
On considère le problème de pilotage d'atelier en temps réel et on propose de construire d'une façon procative une solution présentant de la flexibilité séquentielle pouvant être exploitée...
A Batch Optimization Solver for diffusion area scheduling in semiconductor manufacturing (2007)
Yugma, Claude, Artigues, Christian, Dauzère-Pérès, Stéphane, Derreumaux, Alexandre, Sibille, Olivier
This paper presents a method and a software for solving a batching and scheduling problem in the diffusion area of a semiconductor plant, the ATMEL fabrication unit in Rousset, France. The diffusion...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin, Vergnaud, Adrien
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and job-shop scheduling problem. Each method we investigate uses...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin, Vergnaud, Adrien
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and job-shop scheduling problem. Each method we investigate uses...
A Batch Optimization Solver for diffusion area scheduling in semiconductor manufacturing (2007)
Yugma, Claude, Artigues, Christian, Dauzère-Pérès, Stéphane, Derreumaux, Alexandre, Sibille, Olivier
This paper presents a method and a software for solving a batching and scheduling problem in the diffusion area of a semiconductor plant, the ATMEL fabrication unit in Rousset, France. The diffusion...
Palpant, Mireille, Artigues, Christian, Oliva, Cristian
In this paper, we present a solution approach based on Chv\'{a}tal's Resolution Search [Chvatal 1997] to solve combinatorial optimization problems. Resolution Search constitutes an alternative to...
Palpant, Mireille, Artigues, Christian, Oliva, Cristian
In this paper, we present a solution approach based on Chv\'{a}tal's Resolution Search [Chvatal 1997] to solve combinatorial optimization problems. Resolution Search constitutes an alternative to...
Artigues, Christian, Lopez, Pierre, Ayache, Pierre-Dimitri
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule...
Artigues, Christian, Lopez, Pierre, Ayache, Pierre-Dimitri
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule...
A Batch Optimization Solver for diffusion area scheduling in semiconductor manufacturing (2007)
Yugma, Claude, Artigues, Christian, Dauzère-Pérès, Stéphane, Derreumaux, Alexandre, Sibille, Olivier
This paper presents a method and a software for solving a batching and scheduling problem in the diffusion area of a semiconductor plant, the ATMEL fabrication unit in Rousset, France. The diffusion...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Aloulou, Mohamed Ali, Artigues, Christian
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to provide the...
Models and methods for frequency allocation with cumulative interference constraints (2006)
Palpant, Mireille, Oliva, Cristian, Artigues, Christian, Michelon, Philippe, Didi Biha, Mohamed
We consider a realistic modeling of interferences for frequency allocation in hertzian telecommunication networks. In contrast with traditional interference models based only on binary interference...
Garaix, Thierry, Artigues, Christian, Feillet, Dominique, Josselin, Didier
The class of vehicle routing problems involves the optimization of freight or person transportation activities. These problems are generally treated via the representation of geographical data as a...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin, Vergnaud, Adrien
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and production scheduling problem. Each method we investigate...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin, Vergnaud, Adrien
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and production scheduling problem. Each method we investigate...
Artigues, Christian, Gendreau, Michel, Rousseau, Louis-Martin, Vergnaud, Adrien
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and production scheduling problem. Each method we investigate...
A branch and bound method for the job-shop problem with sequence-dependent setup times (2006)
Artigues, Christian, Feillet, Dominique
This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on...
A branch and bound method for the job-shop problem with sequence-dependent setup times (2006)
Artigues, Christian, Feillet, Dominique
This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on...
Une méthode exacte pour le problème d'ordonnancement d'atelier avec temps de préparation (2006)
Artigues, Christian, Feillet, Dominique
Nous présentons une nouvelle méthode exacte pour résoudre le problème d'ordonnancement d'atelier avec temps de préparation dépendant de la séquence. Pour résoudre ce problème NP-difficile au...
Une méthode exacte pour le problème d'ordonnancement d'atelier avec temps de préparation (2006)
Artigues, Christian, Feillet, Dominique
Nous présentons une nouvelle méthode exacte pour résoudre le problème d'ordonnancement d'atelier avec temps de préparation dépendant de la séquence. Pour résoudre ce problème NP-difficile au...
Artigues, Christian, Lopez, Pierre, Ayache, Pierre-Dimitri
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule...
Une méthode exacte pour le problème d'ordonnancement d'atelier avec temps de préparation (2006)
Artigues, Christian, Feillet, Dominique
Nous présentons une nouvelle méthode exacte pour résoudre le problème d'ordonnancement d'atelier avec temps de préparation dépendant de la séquence. Pour résoudre ce problème NP-difficile au...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (2005)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (2005)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (2005)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (2005)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Artigues, Christian, Lopez, Pierre, Ayache, Pierre-Dimitri
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule...
Artigues, Christian, Lopez, Pierre, Ayache, Pierre-Dimitri
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule...
Insertion Techniques for Static and Dynamic Resource Constrained Project Scheduling (2002)
A flow network model is presented for the static resource-constrained project scheduling problem. Static and dynamic scheduling methods, based on a new polynomial insertion algorithm taking advantage...
Grouping Jobs on a Single Machine With Heads and Tails to Represent (2002)
Jean-charles Billaut, Christian Artigues
We consider the problem of the representation of a set of dominant schedules by a sequence of groups of permutable jobs in a single machine problem with heads and tails. The set is dominant if any...
Solving the Resource-Constraint Project Scheduling Problem By (2002)
Mireille Palpant, Christian Artigues
We present a new heuristic for solving the resource-constrained project scheduling problem. The method is based on the iterative generation of subproblems, each one being solved by an exact method of...
Constraint and Linear Programming : (2001)
Cristian Oliva, Christian Artigues, Agroparc Bp
Reduced costs are commonly used in mixed-integer programming solvers to reduce the bounds of the variables. Such domain reductions can also be performed eciently by contraint propagation techniques...
Insertion Techniques for On and O-Line Resource (2000)
A new formulation of the resource constrained project scheduling problem is given. It is based on a ow network model extending the classical disjunctive graph representation of the job shop...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (1997)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (1997)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...
Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources (1997)
Ce travail présente une méthode et des outils pour l'ordonnancement en temps réel d'atelier lorsque des contraintes complexes issues du terrain sont à prendre en compte. L'approche retenue vise...