The following pages link to Bernard Penz (Q320791):
Displayed 19 items.
- (Q222907) (redirect page) (← links)
- The single-item green lot-sizing problem with fixed carbon emissions (Q320793) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Scheduling cross docking operations under full, partial and no information on inbound arrivals (Q622133) (← links)
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904) (← links)
- Lot sizing with carbon emission constraints (Q2253622) (← links)
- Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform (Q2256198) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs'' (Q2355847) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- A broader view of the economic design of the X-bar chart in the semiconductor industry (Q3163173) (← links)
- Articles ROADEF 2007 (Q3644812) (← links)
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386) (← links)
- Sensitivity analysis of scheduling algorithms (Q5952510) (← links)