Pages that link to "Item:Q1331607"
From MaRDI portal
The following pages link to A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607):
Displaying 22 items.
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (Q336916) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures (Q1017972) (← links)
- A simple heuristic for the multi-item single level capacitated lotsizing problem (Q1079109) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures (Q1331603) (← links)
- Dynamic lot sizing and tool management in automated manufacturing systems (Q1348558) (← links)
- A simple heuristic for multi-product dynamic lot sizing problems (Q1366707) (← links)
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures (Q2907902) (← links)
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems (Q3430249) (← links)
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review (Q3802854) (← links)
- Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing (Q3842990) (← links)
- Heuristic Methods for the Multi-product Dynamic Lot Size Problem (Q3983499) (← links)
- An improved algorithm for the dynamic lot-sizing problem with learning effect in setups (Q4287983) (← links)
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)