Search Results

Documents authored by Roussel, Stéphanie

Document
DOI: 10.4230/LIPIcs.CP.2025.25
Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: A Constraint Programming Approach

Authors: Duc Anh Le, Stéphanie Roussel, and Christophe Lecoutre

Published in: LIPIcs, Volume 340, 31st International Conference on Principles and Practice of Constraint Programming (CP 2025)

Abstract
Balancing aeronautical assembly lines is a major challenge in modern aerospace manufacturing. Aircraft manufacturing plants typically have a predetermined production rate, but the production system requires a period of adaptation at start-up. This phenomenon, known as the learning effect, refers to the gradual improvement in efficiency through task repetition, thereby reducing task duration. However, the stability of an assembly line is also a critical factor, as any change in the production process incurs costs. In this study, Constraint Programming (CP) is used to optimise assembly line balancing, taking into account the learning effect to address the trade-off between achieving target production rates and minimising adjustments to the line.
Cite as

Duc Anh Le, Stéphanie Roussel, and Christophe Lecoutre. Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: A Constraint Programming Approach. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 25:1-25:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{le_et_al:LIPIcs.CP.2025.25,
  author =	{Le, Duc Anh and Roussel, St\'{e}phanie and Lecoutre, Christophe},
  title =	{{Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: A Constraint Programming Approach}},
  booktitle =	{31st International Conference on Principles and Practice of Constraint Programming (CP 2025)},
  pages =	{25:1--25:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-380-5},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{340},
  editor =	{de la Banda, Maria Garcia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.25},
  URN =		{urn:nbn:de:0030-drops-238863},
  doi =		{10.4230/LIPIcs.CP.2025.25},
  annote =	{Keywords: Assembly Line Balancing, Resource-Constrained, Learning Effect, Ramp-Up, Aeronautic, Constraint Programming, Dominance-Breaking}
}
Document
DOI: 10.4230/LIPIcs.CP.2024.18
Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production

Authors: Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre, and Anouck Chan

Published in: LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024)

Abstract
This paper addresses the High Multiplicity Resource-Constrained Project Scheduling Problem (HM-RCPSP), in which multiple projects are performed iteratively while sharing limited resources. We extend this problem by integrating the learning effect, which makes the duration of some activities decrease when they are repeated. Learning effect can be represented by any decreasing function, allowing us to get flexibility in modeling various scenarios. Additionally, we take composition of activities into consideration for reasoning about precedence and resources in a more abstract way. A Constraint Programming model is proposed for this richer problem, including a symmetry-breaking technique applied to some activities. We also present a heuristic-based search strategy. The effectiveness of these solving approaches is evaluated through an experimentation conducted on data concerning real-world satellite assembly lines, as well as on some adapted literature benchmarks. Obtained results demonstrate that our methods serve as robust baselines for addressing this novel problem (denoted by HM-RCPSP/L-C).
Cite as

Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre, and Anouck Chan. Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 18:1-18:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{le_et_al:LIPIcs.CP.2024.18,
  author =	{Le, Duc Anh and Roussel, St\'{e}phanie and Lecoutre, Christophe and Chan, Anouck},
  title =	{{Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production}},
  booktitle =	{30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
  pages =	{18:1--18:25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-336-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{307},
  editor =	{Shaw, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.18},
  URN =		{urn:nbn:de:0030-drops-207037},
  doi =		{10.4230/LIPIcs.CP.2024.18},
  annote =	{Keywords: High-multiplicity Project Scheduling, Learning Effect, Compound Activities, Satellite Assembly Line, Constraint Programming, Symmetry Breaking}
}
Document
DOI: 10.4230/LIPIcs.CP.2024.23
Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations

Authors: Xavier Pucel and Stéphanie Roussel

Published in: LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024)

Abstract
In the context of aircraft assembly lines, increasing the production rate and decreasing the operating costs are two important, and sometimes contradictory, objectives. In small assembly lines, sharing production resources across workstations is a simple and efficient way to reduce operating costs. Therefore, workers are not assigned to a unique workstation but can walk between them. On the other side, paralleling workstations is an efficient way to increase the production rate. However, the combination of both strategies create complex conditions for tasks to access the production resources. This paper addresses the problem of allocating tasks to workstations and scheduling them in an assembly line where workers can freely walk across workstations, and where workstations can be organized in parallel. We model this novel problem with Constraint Programming. We evaluate it on real world industrial use cases coming from aircraft manufacturers, as well as synthetic use cases adapted from the literature.
Cite as

Xavier Pucel and Stéphanie Roussel. Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 23:1-23:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{pucel_et_al:LIPIcs.CP.2024.23,
  author =	{Pucel, Xavier and Roussel, St\'{e}phanie},
  title =	{{Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations}},
  booktitle =	{30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
  pages =	{23:1--23:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-336-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{307},
  editor =	{Shaw, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.23},
  URN =		{urn:nbn:de:0030-drops-207087},
  doi =		{10.4230/LIPIcs.CP.2024.23},
  annote =	{Keywords: Constraint Programming, Assembly Line, Balancing and Scheduling, Parallel Workstations, Walking Workers}
}
Document
DOI: 10.4230/LIPIcs.CP.2023.32
Assembly Line Preliminary Design Optimization for an Aircraft

Authors: Stéphanie Roussel, Thomas Polacsek, and Anouck Chan

Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)

Abstract
In the aeronautics industry, each aircraft family has a dedicated manufacturing system. This system is classically designed once the aircraft design is completely finished, which might lead to poor performance. To mitigate this issue, a strategy is to take into account the production system as early as possible in the aircraft design process. In this work, we define the Assembly Line Preliminary Design Problem, which consists in defining, for a given aircraft design, the best assembly line layout and the type and number of machines equipping each workstation. We propose a Constraint Programming encoding for that problem, along with an algorithm based on epsilon constraint for exploring the set of Pareto solutions. We present experiments run on a set of real industrial data. The results show that the approach is promising and offers support to experts in order to compare aircraft designs with each other.
Cite as

Stéphanie Roussel, Thomas Polacsek, and Anouck Chan. Assembly Line Preliminary Design Optimization for an Aircraft. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 32:1-32:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{roussel_et_al:LIPIcs.CP.2023.32,
  author =	{Roussel, St\'{e}phanie and Polacsek, Thomas and Chan, Anouck},
  title =	{{Assembly Line Preliminary Design Optimization for an Aircraft}},
  booktitle =	{29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
  pages =	{32:1--32:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-300-3},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{280},
  editor =	{Yap, Roland H. C.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.32},
  URN =		{urn:nbn:de:0030-drops-190690},
  doi =		{10.4230/LIPIcs.CP.2023.32},
  annote =	{Keywords: Assembly line design, Constraint Programming, Multi-objective, Industry 4.0}
}
Document
DOI: 10.4230/DagSemProc.09121.7
A modal logic for reasoning on consistency and completeness of regulations

Authors: Christophe Garion, Stéphanie Roussel, and Laurence Cholvy

Published in: Dagstuhl Seminar Proceedings, Volume 9121, Normative Multi-Agent Systems (2009)

Abstract
In this paper, we deal with regulations that may exist in multi-agent systems in order to regulate agent behaviour and we discuss two properties of regulations, that is consistency and completeness. After defining what consistency and completeness mean, we propose a way to consistently complete incomplete regulations. In this contribution, we extend previous works and we consider that regulations are expressed in a first order modal deontic logic.
Cite as

Christophe Garion, Stéphanie Roussel, and Laurence Cholvy. A modal logic for reasoning on consistency and completeness of regulations. In Normative Multi-Agent Systems. Dagstuhl Seminar Proceedings, Volume 9121, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{garion_et_al:DagSemProc.09121.7,
  author =	{Garion, Christophe and Roussel, St\'{e}phanie and Cholvy, Laurence},
  title =	{{A modal logic for reasoning on consistency and completeness of regulations}},
  booktitle =	{Normative Multi-Agent Systems},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9121},
  editor =	{Guido Boella and Pablo Noriega and Gabriella Pigozzi and Harko Verhagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09121.7},
  URN =		{urn:nbn:de:0030-drops-19047},
  doi =		{10.4230/DagSemProc.09121.7},
  annote =	{Keywords: Regulations, consistency, completeness, deontic logic, default logic}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact