A quantitative study of data aggregation for a network design problem: a case of automotive distribution.

Bernard Penz https://orcid.org/0000-0002-2375-9349 https://www.wikidata.org/entity/Q57551705 https://zbmath.org/authors/?q=ai:penz.bernard

Suzanne Le Bihan Gülgün Alpan Bernard Penz A quantitative study of data aggregation for a network design problem: a case of automotive distribution. 3941-3964 2025 August 36 J. Intell. Manuf. 6 https://doi.org/10.1007/s10845-024-02421-3 db/journals/jim/jim36.html#BihanAP25 streams/journals/jim

Adèle Louis Gülgün Alpan Bernard Penz Alain Benichou Mixed-model sequencing versus car sequencing: comparison of feasible solution spaces. 3415-3434 2023 May 61 Int. J. Prod. Res. 10 https://doi.org/10.1080/00207543.2022.2082896 db/journals/ijpr/ijpr61.html#LouisAPB23

Nicolas Catusse Hadrien Cambazard Nadia Brauner Bernard Penz Florian Fontan Innovative ideas for teaching supports: Application to Graph theory. 2022 abs/2209.05078 CoRR https://doi.org/10.48550/arXiv.2209.05078 db/journals/corr/corr2209.html#abs-2209-05078

David Arturo Pardo Melo Vincent Bernier Yannick Frein Bernard Penz Cross-Dock Location: An Airbus Helicopters Case Study. 158-167 2021 APMS (5) https://doi.org/10.1007/978-3-030-85914-5_17 conf/ifip5-7/2021-5 db/conf/ifip5-7/apms2021-5.html#MeloBFP21

Gautier Daras Bruno Agard Bernard Penz Conceptual Framework for SDSS Development with an Application in the Retail Industry. 357-373 2019 61 Bus. Inf. Syst. Eng. 3 https://doi.org/10.1007/s12599-018-0548-y https://www.wikidata.org/entity/Q129579705 db/journals/bise/bise61.html#DarasAP19

Grigori German Hadrien Cambazard Jean-Philippe Gayon Bernard Penz A global constraint for the capacitated single-item lot-sizing problem. 2019 abs/1907.02405 CoRR http://arxiv.org/abs/1907.02405 db/journals/corr/corr1907.html#abs-1907-02405

Gautier Daras Bruno Agard Bernard Penz A spatial data pre-processing tool to improve the quality of the analysis and to reduce preparation duration. 219-232 2018 119 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2018.03.025 https://www.wikidata.org/entity/Q130122236 db/journals/candie/candie119.html#DarasAP18

Ahmed Senoussi Stéphane Dauzère-Pérès Nadjib Brahimi Bernard Penz Nadia Kinza Mouss Heuristics Based on Genetic Algorithms for the Capacitated Multi Vehicle Production Distribution Problem. 108-119 2018 96 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2018.04.010 https://www.wikidata.org/entity/Q129985061 db/journals/cor/cor96.html#SenoussiDBPM18

Wouter Lefever El-Houssaine Aghezzaf Khaled Hadj-Hamou Bernard Penz Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment. 137-148 2018 98 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2018.05.023 https://www.wikidata.org/entity/Q129759566 db/journals/cor/cor98.html#LefeverAHP18

Lâm Laurent Lim Gülgün Alpan Bernard Penz A simulation-optimization approach for sales and operations planning in build-to-order industries with distant sourcing: Focus on the automotive industry. 469-482 2017 112 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2016.12.002 db/journals/candie/candie112.html#LimAP17

Nabil Absi Stéphane Dauzère-Pérès Safia Kedad-Sidhoum Bernard Penz Christophe Rapine The single-item green lot-sizing problem with fixed carbon emissions. 849-855 2016 248 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2015.07.052 db/journals/eor/eor248.html#AbsiDKPR16

Sylvain Ducomman Hadrien Cambazard Bernard Penz Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW. 3390-3396 2016 AAAI https://doi.org/10.1609/aaai.v30i1.10434 conf/aaai/2016 db/conf/aaai/aaai2016.html#DucommanCP16 Nicolas Catusse Hadrien Cambazard Nadia Brauner Pierre Lemaire 0001 Bernard Penz Anne-Marie Lagrange Pascal Rubini A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. 3060-3066 2016 IJCAI http://www.ijcai.org/Abstract/16/434 conf/ijcai/2016 db/conf/ijcai/ijcai2016.html#CatusseCBLPLR16 Sanae Kouismi Loubna Benabbou Najiba Sbihi Bernard Penz Scheduling unloading operations in a railway terminal. 1-6 2016 SITA https://doi.org/10.1109/SITA.2016.7772276 conf/sita/2016 db/conf/sita/sita2016.html#KouismiBSP16

Ayse Akbalik Bernard Penz Christophe Rapine Capacitated lot sizing problems with inventory bounds. 1-18 2015 229 Ann. Oper. Res. 1 https://doi.org/10.1007/s10479-015-1816-6 db/journals/anor/anor229.html#AkbalikPR15

Ayse Akbalik Bernard Penz Christophe Rapine Multi-item uncapacitated lot sizing problem with inventory bounds. 143-154 2015 9 Optim. Lett. 1 https://doi.org/10.1007/s11590-014-0746-6 db/journals/ol/ol9.html#AkbalikPR15

Bertrand Baud-Lavigne Bruno Agard Bernard Penz Environmental constraints in joint product and supply chain design optimization. 16-22 2014 76 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2014.07.014 db/journals/candie/candie76.html#Baud-LavigneAP14

Anne-Laure Ladier Gülgün Alpan Bernard Penz Joint employee weekly timetabling and daily rostering: A decision-support tool for a logistics platform. 278-291 2014 234 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2013.10.023 db/journals/eor/eor234.html#LadierAP14

Bertrand Hellion Fabien Mangione Bernard Penz A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows. 500-504 2014 42 Oper. Res. Lett. 8 https://doi.org/10.1016/j.orl.2014.08.010 db/journals/orl/orl42.html#HellionMP14

Nabil Absi Stéphane Dauzère-Pérès Safia Kedad-Sidhoum Bernard Penz Christophe Rapine Lot sizing with carbon emission constraints. 55-61 2013 227 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2012.11.044 db/journals/eor/eor227.html#AbsiDKPR13

Bertrand Hellion Fabien Mangione Bernard Penz 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]. 279 https://doi.org/10.1016/j.ejor.2013.01.051 2013 229 Eur. J. Oper. Res. 1 db/journals/eor/eor229.html#HellionMP13

Manuel Ruiz Olivier Briant Jean-Maurice Clochard Bernard Penz Large-scale standard pooling problems with constrained pools and fixed demands. 939-956 2013 56 J. Glob. Optim. 3 https://doi.org/10.1007/s10898-012-9869-4 db/journals/jgo/jgo56.html#RuizBCP13

Lâm Laurent Lim Gülgün Alpan Bernard Penz Coordinating Sales and Operations Management in Automobile Industry under Long Procurement Lead Times. 64-69 2013 MIM https://doi.org/10.3182/20130619-3-RU-3018.00281 conf/mim/2013 db/conf/mim/mim2013.html#LimAP13

Bertrand Hellion Fabien Mangione Bernard Penz A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. 10-16 2012 222 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2012.04.024 db/journals/eor/eor222.html#HellionMP12

Sekoun Kébé Najiba Sbihi Bernard Penz A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. 2477-2483 2012 23 J. Intell. Manuf. 6 https://doi.org/10.1007/s10845-011-0514-8 db/journals/jim/jim23.html#KebeSP12

Hadrien Cambazard Bernard Penz A Constraint Programming Approach for the Traveling Purchaser Problem. 735-749 2012 CP https://doi.org/10.1007/978-3-642-33558-7_53 conf/cp/2012 db/conf/cp/cp2012.html#CambazardP12

Gülgün Alpan Rim Larbi Bernard Penz A bounded dynamic programming approach to schedule operations in a cross docking platform. 385-396 2011 60 Comput. Ind. Eng. 3 https://doi.org/10.1016/j.cie.2010.08.012 db/journals/candie/candie60.html#AlpanLP11

Gülgün Alpan Anne-Laure Ladier Rim Larbi Bernard Penz Heuristic solutions for transshipment problems in a multiple door cross docking warehouse. 402-408 2011 61 Comput. Ind. Eng. 2 https://doi.org/10.1016/j.cie.2010.09.010 db/journals/candie/candie61.html#AlpanLLP11

Rim Larbi Gülgün Alpan Pierre Baptiste Bernard Penz Scheduling cross docking operations under full, partial and no information on inbound arrivals. 889-900 2011 38 Comput. Oper. Res. 6 https://doi.org/10.1016/j.cor.2010.10.003 db/journals/cor/cor38.html#LarbiABP11

Nadia Lehoux Sophie D'Amours Yannick Frein André Langevin Bernard Penz Collaboration for a two-echelon supply chain in the pulp and paper industry: the use of incentives to increase profit. 581-592 2011 62 J. Oper. Res. Soc. 4 https://doi.org/10.1057/jors.2009.167 db/journals/jors/jors62.html#LehouxDFLP11

Radwan El Hadj Khalaf Bruno Agard Bernard Penz Module Selection and Supply Chain Optimization for Customized Product Families Using Redundancy and Standardization. 118-129 2011 8 IEEE Trans Autom. Sci. Eng. 1 https://doi.org/10.1109/TASE.2010.2059701 db/journals/tase/tase8.html#KhalafAP11

Radwan El Hadj Khalaf Bruno Agard Bernard Penz An experimental study for the selection of modules and facilities in a mass customization context. 703-716 2010 21 J. Intell. Manuf. 6 https://doi.org/10.1007/s10845-009-0247-0 db/journals/jim/jim21.html#KhalafAP10

Christian Artigues Van-Dat Cung Gerd Finke Bernard Penz Articles ROADEF 2007. 373-374 2009 43 RAIRO Oper. Res. 4 https://doi.org/10.1051/ro/2009030 db/journals/rairo/rairo43.html#ArtiguesCFP09

Ayse Akbalik Sekoun Kébé Bernard Penz Najiba Sbihi Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. 195-214 2008 15 Int. Trans. Oper. Res. 2 https://doi.org/10.1111/j.1475-3995.2008.00627.x db/journals/itor/itor15.html#AkbalikKPS08

Cherif Sadfi Bernard Penz Christophe Rapine Jacek Blazewicz Piotr Formanowicz An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. 3-10 2005 161 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2003.08.026 https://www.wikidata.org/entity/Q57387775 db/journals/eor/eor161.html#SadfiPRBF05

Bernard Penz Christophe Rapine Denis Trystram Sensitivity analysis of scheduling algorithms. 606-615 2001 134 Eur. J. Oper. Res. 3 https://doi.org/10.1016/S0377-2217(00)00281-2 https://www.wikidata.org/entity/Q126551385 db/journals/eor/eor134.html#PenzRT01

Marie-Laure Espinouse Piotr Formanowicz Bernard Penz Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability. 116-121 2001 52 J. Oper. Res. Soc. 1 https://doi.org/10.1057/palgrave.jors.2601025 db/journals/jors/jors52.html#EspinouseFP01

Jacek Blazewicz Frédéric Guinand Bernard Penz Denis Trystram Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays. 267-278 2000 10 Parallel Process. Lett. 4 db/journals/ppl/ppl10.html#BlazewiczGPT00 https://doi.org/10.1142/S0129626400000263

Bernard Penz Lionel Dupont An aggregation procedure for the deterministic job-shop problem. 117-122 1995 6 J. Intell. Manuf. 2 https://doi.org/10.1007/BF00123683 db/journals/jim/jim6.html#PenzD95

Bernard Penz Constructions agrégatives d'ordonnancements pour des jobs-shops statiques, dynamiques et réactifs. (Aggregation methods for static, dynamic and reactive job-shops). 1994 Joseph Fourier University, Grenoble, France https://tel.archives-ouvertes.fr/tel-00005107 Nabil Absi Bruno Agard El Houssaine AghezzafEl-Houssaine Aghezzaf Ayse Akbalik Gülgün Alpan-GaujalGülgün Alpan Christian Artigues Pierre Baptiste Bertrand Baud-Lavigne Loubna Benabbou Alain Benichou Vincent Bernier Suzanne Le Bihan Jacek Blazewicz Nadjib Brahimi Nadia Brauner Olivier Briant Hadrien Cambazard Nicolas Catusse Jean-Maurice Clochard Van-Dat Cung Sophie D'Amours Gautier Daras Stéphane Dauzère-Pérès Sylvain Ducomman Lionel Dupont Marie-Laure Espinouse Gerd Finke Florian Fontan Piotr Formanowicz Yannick Frein Jean-Philippe Gayon Grigori German Frédéric Guinand Khaled Hadj-Hamou Bertrand Hellion Sekoun Kébé Safia Kedad-Sidhoum Radwan El Hadj Khalaf Sanae Kouismi Anne-Laure Ladier Anne-Marie Lagrange André Langevin Rim Larbi Wouter Lefever Nadia Lehoux Pierre Lemaire 0001 Lâm Laurent Lim Adèle Louis Fabien Mangione David Arturo Pardo Melo Nadia Kinza Mouss Christophe Rapine Pascal Rubini Manuel Ruiz Cherif Sadfi Najiba Sbihi Ahmed Senoussi Denis Trystram