A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks
From MaRDI portal
Publication:2454335
DOI10.1007/s00291-013-0349-0zbMath1290.90058OpenAlexW2085008679MaRDI QIDQ2454335
Tim Schöneberg, Achim Koberstein, Leena M. Suhl
Publication date: 13 June 2014
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-013-0349-0
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)
Related Items (2)
A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks ⋮ A mathematical programming model for integrating production and procurement transport decisions
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of outbound dispatch policies for integrated inventory and transportation decisions
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- A general quantity discount and supplier selection mixed integer programming model
- Joint replenishment inventory control: Deterministic and stochastic models
- A classification of literature on determining the lot size under quantity discounts
- Lot sizing and scheduling -- survey and extensions
- Service network design in freight transportation
- The deterministic multi-item dynamic lot size problem with joint business volume discount
- Coordinating supply chain inventories through common replenishment epochs
- Scenario reduction algorithms in stochastic programming
- Supply chain planning in the German automotive industry
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks
- Dynamic Version of the Economic Lot Size Model
- Joint Inventory Replenishments with Group Discounts Based on Invoice Value
- The dynamic lot size model with quantity discount
- Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- A Simple Inventory Replenishment Decision Rule for a Linear Trend in Demand
- A Modification of the Silver-Meal Heuristic to Handle MRP Purchase Discount Situations
- Minimizing Transportation and Inventory Costs for Several Products on a Single Link
- Network optimization in supply chain management and financial engineering: An annotated bibliography
- Models and algorithms for the dynamic-demand joint replenishment problem
- Modeling industrial lot sizing problems: a review
- Inventory routing problems: a logistical overview
This page was built for publication: A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks
