Brauner, Nadia, Naves, Guyslain
We consider a scheduling problem that arises from an industrial application in chemical experimentations, where a single machine can process a fixed number of compatible jobs simultaneously. The...
Brauner, Nadia, Naves, Guyslain
We consider a scheduling problem that arises from an industrial application in chemical experimentations, where a single machine can process a fixed number of compatible jobs simultaneously. The...
Ordonnancement des cellules robotisées pour une production mono-produit (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Cette étude permet donc de calculer les cycles optimaux pour le problème des cellules robotisées. Les temps de calcul étant trop importants pour des lignes à six machines ou plus, cette méthode...
Optimal cycles for the robotic balanced no-wait flow shop (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
In a no-wait robotic flow-shop, the parts are transferred from a machine to another one by a robot and the time a part can remain on a machine is fixed. The objective is to maximize the throughput...
Three-tank hoist scheduling problem with unbounded or zero-width processing windows (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
On surface treatment lines, the products are transferred in successive tanks by a hoist. Aninteresting problem for this kind of lines is to find the hoist moves which maximise productivity. Moreover,...
Flow shop robotisé à quatre machine sans attente (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Dans les cellules robotisées sans attente, les pièces doivent rester sur les machines pendant un temps fixe. Les pièces sont transportées d'une machine à l'autre par un robot. Un des problèmes...
Degree of the dominant cycles in no-wait robotic cells (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
In a no-wait robotic cell, we proved that the smallest degree of an optimal cycle, kappa, can take any value between 1 and (m+1)/2. We also proved that kappa can be equal to m-1 for m=4 and that...
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Dans cette communication, nous démontrons que, pour une ligne de traitements de surface comportant trois cuves, les cycles optimaux sont des 1-cycles ou des 2-cycles, si les tolérances sur les...
Ordonnancement des cellules robotisées pour une production mono-produit (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Cette étude permet donc de calculer les cycles optimaux pour le problème des cellules robotisées. Les temps de calcul étant trop importants pour des lignes à six machines ou plus, cette méthode...
Optimal cycles for the robotic balanced no-wait flow shop (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
In a no-wait robotic flow-shop, the parts are transferred from a machine to another one by a robot and the time a part can remain on a machine is fixed. The objective is to maximize the throughput...
Three-tank hoist scheduling problem with unbounded or zero-width processing windows (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
On surface treatment lines, the products are transferred in successive tanks by a hoist. Aninteresting problem for this kind of lines is to find the hoist moves which maximise productivity. Moreover,...
Flow shop robotisé à quatre machine sans attente (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Dans les cellules robotisées sans attente, les pièces doivent rester sur les machines pendant un temps fixe. Les pièces sont transportées d'une machine à l'autre par un robot. Un des problèmes...
Degree of the dominant cycles in no-wait robotic cells (2008)
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
In a no-wait robotic cell, we proved that the smallest degree of an optimal cycle, kappa, can take any value between 1 and (m+1)/2. We also proved that kappa can be equal to m-1 for m=4 and that...
Mangione, Fabien, Brauner, Nadia, Penz, Bernard
Dans cette communication, nous démontrons que, pour une ligne de traitements de surface comportant trois cuves, les cycles optimaux sont des 1-cycles ou des 2-cycles, si les tolérances sur les...
Operator Non-Availability Periods (2007)
Brauner, Nadia, Finke, Gerd, Lehoux-Lebacque, Vassilissa, Rapine, Christophe, Potts, Chris, Strusevich, Vitaly
In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the...
Operator Non-Availability Periods (2007)
Brauner, Nadia, Finke, Gerd, Lehoux-Lebacque, Vassilissa, Rapine, Christophe, Potts, Chris, Strusevich, Vitaly
In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the...
On symmetric Fraenkel's and small deviations conjectures (2006)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
On the complexity of high multiplicity scheduling problems (2006)
Brauner, Nadia, Crama, Y., Grigoriev, A., Van De Klundert, J.
The purpose of this note is to propose a definition of several complexity classes which could prove useful for the analysis of high multiplicity scheduling problems. Part of this framework relies on...
On symmetric Fraenkel's and small deviations conjectures (2006)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
On the complexity of high multiplicity scheduling problems (2006)
Brauner, Nadia, Crama, Y., Grigoriev, A., Van De Klundert, J.
The purpose of this note is to propose a definition of several complexity classes which could prove useful for the analysis of high multiplicity scheduling problems. Part of this framework relies on...
Cyclic scheduling in robotic cells: about Agnetis' conjecture for the classical case (2006)
Robotic cells consists of a flow-shop with a circular layout and a single transporter, a robot, for the material handling. A single part is to be produced and the objective is to minimize the...
Two-machine flowshops with material handling (2006)
Lebacque, Vassilissa, Brauner, Nadia
This paper concerns the minimization of the makespan when producing different parts in a 2-machine cell with a robot as the material handling. In the literature, two problems have been studied...
Identical part production in cyclic robotic cells: a state of the art (2006)
This document gives a state of the art on cyclic scheduling of identical parts in robotic cells. It describes classical configurations of robotic cells and introduces basic concepts and tools for...
Comparison of objective functions for the JIT problem (2006)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
A Set-Covering Approach for SONET Network Design (2006)
Brauner, Nadia, Lemaire, Pierre
In this paper we formalize a graph-partitioning problem that arises in the design of SONET networks as a Set-Covering problem. We then improve the general performance ratio of the Greedy Algorithm...
A Set-Covering Approach for SONET Network Design (2006)
Brauner, Nadia, Lemaire, Pierre
In this paper we formalize a graph-partitioning problem that arises in the design of SONET networks as a Set-Covering problem. We then improve the general performance ratio of the Greedy Algorithm...
Comparison of objective functions for the JIT problem (2006)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
Cyclic scheduling in robotic cells: about Agnetis' conjecture for the classical case (2006)
Robotic cells consists of a flow-shop with a circular layout and a single transporter, a robot, for the material handling. A single part is to be produced and the objective is to minimize the...
Two-machine flowshops with material handling (2006)
Lebacque, Vassilissa, Brauner, Nadia
This paper concerns the minimization of the makespan when producing different parts in a 2-machine cell with a robot as the material handling. In the literature, two problems have been studied...
Identical part production in cyclic robotic cells: a state of the art (2006)
This document gives a state of the art on cyclic scheduling of identical parts in robotic cells. It describes classical configurations of robotic cells and introduces basic concepts and tools for...
Cyclic scheduling in robotic cells: about Agnetis' conjecture for the classical case (2005)
Robotic cells consists of a flow-shop with a circular layout and a single transporter, a robot, for the material handling. A single part is to be produced and the objective is to minimize the...
Two-machine flowshops with material handling (2005)
Lebacque, Vassilissa, Brauner, Nadia
This paper concerns the minimization of the makespan when producing different parts in a 2-machine cell with a robot as the material handling. In the literature, two problems have been studied...
Identical part production in cyclic robotic cells: a state of the art (2005)
This document gives a state of the art on cyclic scheduling of identical parts in robotic cells. It describes classical configurations of robotic cells and introduces basic concepts and tools for...
Cyclic scheduling in robotic cells: about Agnetis' conjecture for the classical case (2005)
Robotic cells consists of a flow-shop with a circular layout and a single transporter, a robot, for the material handling. A single part is to be produced and the objective is to minimize the...
Two-machine flowshops with material handling (2005)
Lebacque, Vassilissa, Brauner, Nadia
This paper concerns the minimization of the makespan when producing different parts in a 2-machine cell with a robot as the material handling. In the literature, two problems have been studied...
Identical part production in cyclic robotic cells: a state of the art (2005)
This document gives a state of the art on cyclic scheduling of identical parts in robotic cells. It describes classical configurations of robotic cells and introduces basic concepts and tools for...
Comparison of objective functions for the JIT problem (2004)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
Comparison of objective functions for the JIT problem (2004)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
On symmetric Fraenkel's and small deviations conjectures (2002)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
A Set-Covering Approach for SONET Network Design (2002)
Brauner, Nadia, Lemaire, Pierre
In this paper we formalize a graph-partitioning problem that arises in the design of SONET networks as a Set-Covering problem. We then improve the general performance ratio of the Greedy Algorithm...
On symmetric Fraenkel's and small deviations conjectures (2002)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
A Set-Covering Approach for SONET Network Design (2002)
Brauner, Nadia, Lemaire, Pierre
In this paper we formalize a graph-partitioning problem that arises in the design of SONET networks as a Set-Covering problem. We then improve the general performance ratio of the Greedy Algorithm...
Three-Tank Hoist Scheduling Problem With Unbounded Or Zero-Width (2001)
Fabien Mangione, Nadia Brauner, Bernard Penz
On surface treatment lines, the products are transferred in successive tanks by a hoist. Moreover, each processing time is nested between a minimal and a maximal duration. This constraint is called...
On the complexity of high multiplicity scheduling problems (2001)
Brauner, Nadia, Crama, Y., Grigoriev, A., Van De Klundert, J.
The purpose of this note is to propose a definition of several complexity classes which could prove useful for the analysis of high multiplicity scheduling problems. Part of this framework relies on...
On the complexity of high multiplicity scheduling problems (2001)
Brauner, Nadia, Crama, Y., Grigoriev, A., Van De Klundert, J.
The purpose of this note is to propose a definition of several complexity classes which could prove useful for the analysis of high multiplicity scheduling problems. Part of this framework relies on...