Audrey Cerqueus

Orcid: 0000-0003-0430-5971

According to our database1, Audrey Cerqueus authored at least 12 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Mathematical Model Integrating Line Balancing, Equipment Selection, and Workforce Management.
Proceedings of the 20th IEEE International Conference on Automation Science and Engineering, 2024

2023
Evaluating the scalability of reconfigurable manufacturing systems at the design phase.
Int. J. Prod. Res., December, 2023

2021
A Bi-objective Based Measure for the Scalability of Reconfigurable Manufacturing Systems.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

Simulation Model for a Semi-automated Retail Order Picking System Under Uncertainty.
Proceedings of the Smart and Sustainable Collaborative Networks 4.0, 2021

2020
Reconfigurable Digitalized and Servitized Production Systems: Requirements and Challenges.
Proceedings of the Advances in Production Management Systems. Towards Smart and Digital Manufacturing, 2020

Balancing and Configuration Planning of RMS to Minimize Energy Cost.
Proceedings of the Advances in Production Management Systems. Towards Smart and Digital Manufacturing, 2020

2019
Additive, Structural, and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC Matrices.
IEEE Trans. Commun., 2019

A branch-and-bound method for the bi-objective simple line assembly balancing problem.
Int. J. Prod. Res., 2019

Towards Reconfigurable Digitalized and Servitized Manufacturing Systems: Conceptual Framework.
Proceedings of the Advances in Production Management Systems. Production Management for the Factory of the Future, 2019

2017
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.
J. Heuristics, 2017

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).
PhD thesis, 2015

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems.
Eur. J. Oper. Res., 2015


  Loading...