Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
From MaRDI portal
Recommendations
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem
- An efficient algorithm for the capacitated single item dynamic lot size problem
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
Cited in
(9)- Multi-item lot-sizing with joint set-up costs
- Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem
- A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints
- Managing procurement and production outsourcing under dynamic prices
- Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- Modeling industrial lot sizing problems: a review
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
This page was built for publication: Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423273)
