Optimal Multi-Level Lot Sizing for Requirements Planning Systems
From MaRDI portal
Cited in
(19)- The efficient computer implementation of a large-scale integer goal programming model
- Layering strategies for creating exploitable structure in linear and integer programs
- Triangularity of the basis in linear programs for material requirements planning
- A heuristic method for lot-sizing in multi-stage systems
- Improved heuristic methods for multiple stage production planning.
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Randomized multi-level lot-sizing heuristics for general product structures.
- The application of valid inequalities to the multi-stage lot-sizing problem
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Lot sizing with inventory gains
- Echelon stock formulation for multi-stage lot-sizing with component lead times
- Multi-stage lot sizing in a serial production system
- Combining items for lot sizing in multi-level assembly systems
- Maximum outflow in generalized flow networks
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- A survey of dynamic network flows
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
This page was built for publication: Optimal Multi-Level Lot Sizing for Requirements Planning Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893617)
