Pages that link to "Item:Q922926"
From MaRDI portal
The following pages link to Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926):
Displaying 23 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Multilevel capacitated lotsizing complexity and LP-based heuristics (Q811334) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← 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 new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing (Q1374386) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Parameter controlled instance generation for lot sizing problems (Q1969543) (← links)
- An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← 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)
- Single item lot sizing problems (Q2566041) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems (Q3392091) (← links)
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review (Q3802854) (← links)
- Time-partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot-sizing problems (Q4266754) (← links)
- A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs (Q4862299) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)