Pages that link to "Item:Q3753761"
From MaRDI portal
The following pages link to Note—Performance Bounds for Lot Sizing Heuristics (Q3753761):
Displayed 15 items.
- On the power of lookahead in online lot-sizing (Q614030) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← 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)
- Comparative study of dynamic lot sizing heuristics with backlogging (Q1200833) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← 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)
- Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand (Q2462155) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- Comparative analysis of lot-sizing models for multi-stage systems: a simulation study (Q3356026) (← links)
- Efficient heuristics for dynamic lot sizing (Q3768654) (← links)
- A combined heuristic approach to dynamic lot sizing problems (Q4732282) (← links)