Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
From MaRDI portal
Publication:3423273
DOI10.1002/nav.20129zbMath1106.90029OpenAlexW2022785221MaRDI QIDQ3423273
Publication date: 20 February 2007
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20129
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (8)
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs ⋮ Managing procurement and production outsourcing under dynamic prices ⋮ Modeling industrial lot sizing problems: a review ⋮ Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions ⋮ Single‐warehouse multi‐retailer inventory systems with full truckload shipments ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Multi-item lot-sizing with joint set-up costs
This page was built for publication: Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
