default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Penz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Adèle Louis
, Gülgün Alpan, Bernard Penz, Alain Benichou:
Mixed-model sequencing versus car sequencing: comparison of feasible solution spaces. Int. J. Prod. Res. 61(10): 3415-3434 (2023)- 2022
- [i2]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan:
Innovative ideas for teaching supports: Application to Graph theory. CoRR abs/2209.05078 (2022) - 2021
- [c6]David Arturo Pardo Melo, Vincent Bernier, Yannick Frein, Bernard Penz:
Cross-Dock Location: An Airbus Helicopters Case Study. APMS (5) 2021: 158-167
2010 – 2019
- 2019
- [j29]Gautier Daras, Bruno Agard, Bernard Penz:
Conceptual Framework for SDSS Development with an Application in the Retail Industry. Bus. Inf. Syst. Eng. 61(3): 357-373 (2019) - [i1]Grigori German, Hadrien Cambazard, Jean-Philippe Gayon, Bernard Penz:
A global constraint for the capacitated single-item lot-sizing problem. CoRR abs/1907.02405 (2019) - 2018
- [j28]Gautier Daras, Bruno Agard, Bernard Penz:
A spatial data pre-processing tool to improve the quality of the analysis and to reduce preparation duration. Comput. Ind. Eng. 119: 219-232 (2018) - [j27]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. Comput. Oper. Res. 96: 108-119 (2018) - [j26]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. Comput. Oper. Res. 98: 137-148 (2018) - 2017
- [j25]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. Comput. Ind. Eng. 112: 469-482 (2017) - 2016
- [j24]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. Eur. J. Oper. Res. 248(3): 849-855 (2016) - [c5]Sylvain Ducomman, Hadrien Cambazard, Bernard Penz:
Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW. AAAI 2016: 3390-3396 - [c4]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini:
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. IJCAI 2016: 3060-3066 - [c3]Sanae Kouismi, Loubna Benabbou, Najiba Sbihi, Bernard Penz:
Scheduling unloading operations in a railway terminal. SITA 2016: 1-6 - 2015
- [j23]Ayse Akbalik, Bernard Penz, Christophe Rapine:
Capacitated lot sizing problems with inventory bounds. Ann. Oper. Res. 229(1): 1-18 (2015) - [j22]Ayse Akbalik, Bernard Penz, Christophe Rapine:
Multi-item uncapacitated lot sizing problem with inventory bounds. Optim. Lett. 9(1): 143-154 (2015) - 2014
- [j21]Bertrand Baud-Lavigne, Bruno Agard, Bernard Penz:
Environmental constraints in joint product and supply chain design optimization. Comput. Ind. Eng. 76: 16-22 (2014) - [j20]Anne-Laure Ladier, Gülgün Alpan, Bernard Penz:
Joint employee weekly timetabling and daily rostering: A decision-support tool for a logistics platform. Eur. J. Oper. Res. 234(1): 278-291 (2014) - [j19]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. Oper. Res. Lett. 42(8): 500-504 (2014) - 2013
- [j18]Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Bernard Penz, Christophe Rapine:
Lot sizing with carbon emission constraints. Eur. J. Oper. Res. 227(1): 55-61 (2013) - [j17]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]. Eur. J. Oper. Res. 229(1): 279 (2013) - [j16]Manuel Ruiz, Olivier Briant, Jean-Maurice Clochard, Bernard Penz:
Large-scale standard pooling problems with constrained pools and fixed demands. J. Glob. Optim. 56(3): 939-956 (2013) - [c2]Lâm Laurent Lim, Gülgün Alpan, Bernard Penz:
Coordinating Sales and Operations Management in Automobile Industry under Long Procurement Lead Times. MIM 2013: 64-69 - 2012
- [j15]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. Eur. J. Oper. Res. 222(1): 10-16 (2012) - [j14]Sekoun Kébé, Najiba Sbihi, Bernard Penz:
A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. J. Intell. Manuf. 23(6): 2477-2483 (2012) - [c1]Hadrien Cambazard, Bernard Penz:
A Constraint Programming Approach for the Traveling Purchaser Problem. CP 2012: 735-749 - 2011
- [j13]Gülgün Alpan, Rim Larbi, Bernard Penz:
A bounded dynamic programming approach to schedule operations in a cross docking platform. Comput. Ind. Eng. 60(3): 385-396 (2011) - [j12]Gülgün Alpan, Anne-Laure Ladier, Rim Larbi, Bernard Penz:
Heuristic solutions for transshipment problems in a multiple door cross docking warehouse. Comput. Ind. Eng. 61(2): 402-408 (2011) - [j11]Rim Larbi, Gülgün Alpan, Pierre Baptiste, Bernard Penz:
Scheduling cross docking operations under full, partial and no information on inbound arrivals. Comput. Oper. Res. 38(6): 889-900 (2011) - [j10]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. J. Oper. Res. Soc. 62(4): 581-592 (2011) - [j9]Radwan El Hadj Khalaf, Bruno Agard, Bernard Penz:
Module Selection and Supply Chain Optimization for Customized Product Families Using Redundancy and Standardization. IEEE Trans Autom. Sci. Eng. 8(1): 118-129 (2011) - 2010
- [j8]Radwan El Hadj Khalaf, Bruno Agard, Bernard Penz:
An experimental study for the selection of modules and facilities in a mass customization context. J. Intell. Manuf. 21(6): 703-716 (2010)
2000 – 2009
- 2009
- [j7]Christian Artigues, Van-Dat Cung, Gerd Finke, Bernard Penz:
Articles ROADEF 2007. RAIRO Oper. Res. 43(4): 373-374 (2009) - 2008
- [j6]Ayse Akbalik, Sekoun Kébé, Bernard Penz, Najiba Sbihi:
Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. Int. Trans. Oper. Res. 15(2): 195-214 (2008) - 2005
- [j5]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. Eur. J. Oper. Res. 161(1): 3-10 (2005) - 2001
- [j4]Bernard Penz, Christophe Rapine, Denis Trystram:
Sensitivity analysis of scheduling algorithms. Eur. J. Oper. Res. 134(3): 606-615 (2001) - [j3]Marie-Laure Espinouse, Piotr Formanowicz, Bernard Penz:
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability. J. Oper. Res. Soc. 52(1): 116-121 (2001) - 2000
- [j2]Jacek Blazewicz, Frédéric Guinand, Bernard Penz, Denis Trystram:
Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays. Parallel Process. Lett. 10(4): 267-278 (2000)
1990 – 1999
- 1995
- [j1]Bernard Penz, Lionel Dupont:
An aggregation procedure for the deterministic job-shop problem. J. Intell. Manuf. 6(2): 117-122 (1995) - 1994
- [b1]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). Joseph Fourier University, Grenoble, France, 1994
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
