Bernard Penz

Orcid: 0000-0002-2375-9349

According to our database1, Bernard Penz authored at least 39 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Mixed-model sequencing versus car sequencing: comparison of feasible solution spaces.
Int. J. Prod. Res., May, 2023

2022
Innovative ideas for teaching supports: Application to Graph theory.
CoRR, 2022

2021
Cross-Dock Location: An Airbus Helicopters Case Study.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2019
A global constraint for the capacitated single-item lot-sizing problem.
CoRR, 2019

Conceptual Framework for SDSS Development with an Application in the Retail Industry.
Bus. Inf. Syst. Eng., 2019

2018
Heuristics Based on Genetic Algorithms for the Capacitated Multi Vehicle Production Distribution Problem.
Comput. Oper. Res., 2018

Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment.
Comput. Oper. Res., 2018

A spatial data pre-processing tool to improve the quality of the analysis and to reduce preparation duration.
Comput. Ind. Eng., 2018

2017
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., 2017

2016
The single-item green lot-sizing problem with fixed carbon emissions.
Eur. J. Oper. Res., 2016

Scheduling unloading operations in a railway terminal.
Proceedings of the 11th International Conference on Intelligent Systems: Theories and Applications, 2016

A Branch-and-Price Algorithm for Scheduling Observations on a Telescope.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Multi-item uncapacitated lot sizing problem with inventory bounds.
Optim. Lett., 2015

Capacitated lot sizing problems with inventory bounds.
Ann. Oper. Res., 2015

2014
A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.
Oper. Res. Lett., 2014

Joint employee weekly timetabling and daily rostering: A decision-support tool for a logistics platform.
Eur. J. Oper. Res., 2014

Environmental constraints in joint product and supply chain design optimization.
Comput. Ind. Eng., 2014

2013
Large-scale standard pooling problems with constrained pools and fixed demands.
J. Glob. Optim., 2013

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., 2013

Lot sizing with carbon emission constraints.
Eur. J. Oper. Res., 2013

Coordinating Sales and Operations Management in Automobile Industry under Long Procurement Lead Times.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem.
J. Intell. Manuf., 2012

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

A Constraint Programming Approach for the Traveling Purchaser Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Module Selection and Supply Chain Optimization for Customized Product Families Using Redundancy and Standardization.
IEEE Trans Autom. Sci. Eng., 2011

Collaboration for a two-echelon supply chain in the pulp and paper industry: the use of incentives to increase profit.
J. Oper. Res. Soc., 2011

Scheduling cross docking operations under full, partial and no information on inbound arrivals.
Comput. Oper. Res., 2011

A bounded dynamic programming approach to schedule operations in a cross docking platform.
Comput. Ind. Eng., 2011

Heuristic solutions for transshipment problems in a multiple door cross docking warehouse.
Comput. Ind. Eng., 2011

2010
An experimental study for the selection of modules and facilities in a mass customization context.
J. Intell. Manuf., 2010

2009
Articles ROADEF 2007.
RAIRO Oper. Res., 2009

2008
Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem.
Int. Trans. Oper. Res., 2008

2005
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints.
Eur. J. Oper. Res., 2005

2001
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability.
J. Oper. Res. Soc., 2001

Sensitivity analysis of scheduling algorithms.
Eur. J. Oper. Res., 2001

2000
Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays.
Parallel Process. Lett., 2000

1995
An aggregation procedure for the deterministic job-shop problem.
J. Intell. Manuf., 1995

1994
Constructions agrégatives d'ordonnancements pour des jobs-shops statiques, dynamiques et réactifs. (Aggregation methods for static, dynamic and reactive job-shops).
PhD thesis, 1994


  Loading...