Audrey Cerqueus

13 papers C 1Journal 6Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
Applications of artificial intelligence in industry 4.0 and smart manufacturing.
Eng. Appl. Artif. Intell.
Audrey Cerqueus, Alexandre Dolgui, Dmitry A. Ivanov, Alexandr Klimchik, David Lemoine, Anatol Pashkevich
2024 — conf
A Mathematical Model Integrating Line Balancing, Equipment Selection, and Workforce Management.
CASE
Hamidreza Rezaei, Simon Thevenin, Audrey Cerqueus
2023 J jnl
Evaluating the scalability of reconfigurable manufacturing systems at the design phase.
Int. J. Prod. Res.
Audrey Cerqueus, Xavier Delorme
2021 — conf
A Bi-objective Based Measure for the Scalability of Reconfigurable Manufacturing Systems.
APMS (2)
Audrey Cerqueus, Xavier Delorme
2021 C conf
Simulation Model for a Semi-automated Retail Order Picking System Under Uncertainty.
PRO-VE
Sawssen Souiden, Audrey Cerqueus, Xavier Delorme, Jean-Lucien Rascle
2020 — conf
Balancing and Configuration Planning of RMS to Minimize Energy Cost.
APMS (2)
Audrey Cerqueus, Paolo Gianessi, Damien Lamy, Xavier Delorme
2020 — conf
Reconfigurable Digitalized and Servitized Production Systems: Requirements and Challenges.
APMS (2)
Magdalena Paul, Audrey Cerqueus, Daniel Schneider, Hichem Haddou Benderbal, Xavier Boucher, Damien Lamy, Gunther Reinhart
2019 J jnl
A branch-and-bound method for the bi-objective simple line assembly balancing problem.
Int. J. Prod. Res.
Audrey Cerqueus, Xavier Delorme
2019 J jnl
Additive, Structural, and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC Matrices.
IEEE Trans. Commun.
Alban Derrien, Emmanuel Boutillon, Audrey Cerqueus
2019 — conf
Towards Reconfigurable Digitalized and Servitized Manufacturing Systems: Conceptual Framework.
APMS (1)
Xavier Boucher, Audrey Cerqueus, Xavier Delorme, Clemens Gonnermann, Magdalena Paul, Gunther Reinhart, Julia Schulz, Fabian Sippl
2017 J jnl
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.
J. Heuristics
Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion
2015 — —
Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate upper bound sets, dynamic branching strategies, generation and exploitation of cover inequalities. (Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires / Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires : ensembles bornants surrogate, stratégies de branchement dynamiques, génération et exploitation d'inégalités de couverture).
Audrey Cerqueus
2015 J jnl
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems.
Eur. J. Oper. Res.
Audrey Cerqueus, Anthony Przybylski, Xavier Gandibleux