Calculating safety stocks for assembly systems with random component procurement lead times: a branch and bound algorithm
From MaRDI portal
Publication:1042216
DOI10.1016/j.ejor.2007.11.066zbMath1176.90028OpenAlexW1963755332MaRDI QIDQ1042216
Mohamed-Aly Ould Louly, Alexandre Dolgui
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.066
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal \((Q,r)\) policy for a multipart assembly system under stochastic part procurement lead times
- Analysis of a single-stage, single-product, stochastic, MRP-controlled assembly system
- Random lead times and expedited orders in \((Q,r)\) inventory systems
- The application of valid inequalities to the multi-stage lot-sizing problem
- An Inventory Model with Order Crossover
- On the Stochastic Non-sequential Production-planning Problem
- Stock Control with Two Suppliers and Normal Lead Times
- Technical Note—The EOQ Model under Stochastic Lead Time
- Near Myopic Heuristics for the Fixed-Life Perishability Problem
- Supply management in assembly systems
- Pricing and the Newsvendor Problem: A Review with Extensions
- Generalized newsboy model to compute the optimal planned lead times in assembly systems
- A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times
- A Dynamic Inventory Model with Stochastic Lead Times
- Safety stock reduction by order splitting
This page was built for publication: Calculating safety stocks for assembly systems with random component procurement lead times: a branch and bound algorithm
