Pages that link to "Item:Q1160558"
From MaRDI portal
The following pages link to Worst case performance for lot sizing heuristics (Q1160558):
Displaying 16 items.
- On the power of lookahead in online lot-sizing (Q614030) (← links)
- A methodology for controlling dispersion in food production and distribution (Q708874) (← links)
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters (Q1015306) (← links)
- Eyeballing heuristics for dynamic lot size problems (Q1118517) (← links)
- Sensitivity analysis of the economic lot-sizing problem (Q1309816) (← links)
- Eyeballing heuristics for dynamic lot sizing problems with rolling horizons (Q1373878) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Online economic ordering problem for deteriorating items with limited price information (Q2084607) (← links)
- Online lot-sizing problems with ordering, holding and shortage costs (Q2275583) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand (Q2514765) (← links)
- Comparative analysis of lot-sizing models for multi-stage systems: a simulation study (Q3356026) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- A combined heuristic approach to dynamic lot sizing problems (Q4732282) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)