A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Eur. J. Oper. Res., 2012)

Corrigendum to "A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs" [Eur. J. Oper. Res. (2012) 10-16]. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Eur. J. Oper. Res., 2013)

A step toward capacity planning at finite capacity in semiconductor manufacturing. - Emna Mhiri; Mireille Jacomino; Fabien Mangione; Philippe Vialletelle; Guillaume Lepelletier (WSC, 2014)

A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Oper. Res. Lett., 2014)

An Extended Circular Supply Chain Model Including Repurposing Activities. - Asiye Kurt; Van-Dat Cung; Fabien Mangione; Mario Cortes Cornax; Agnès Front (ICCAD, 2019)

A Complete Digital Chain to Enable the Digital Twin of a Shop Floor. - Frédéric Noël; Gülgün Alpan; Fabien Mangione (PLM, 2020)

A Classification Tool for Circular Supply Chain Indicators. - Asiye Kurt; Mario Cortes Cornax; Van-Dat Cung; Agnès Front; Fabien Mangione (APMS (5), 2021)

CircuSChain: a Method to Continuously Improve Circularity in Supply Chains. - Asiye Kurt; Mario Cortes Cornax; Agnès Front; Van-Dat Cung; Fabien Mangione (INFORSID, 2023)