New model and heuristics for safety stock placement in general acyclic supply chain networks
From MaRDI portal
Publication:1762120
DOI10.1016/j.cor.2011.08.001zbMath1251.90056OpenAlexW2112270538MaRDI QIDQ1762120
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.001
project schedulinggenetic algorithm (GA)constraint programming (CP)general acyclic networkinventory positioningsafety stock placement
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
The optimal replenishment policy for time-varying stochastic demand under vendor managed inventory ⋮ Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times ⋮ Finite inventory budgets in production capacity and safety stock placement under the guaranteed service approach ⋮ Two-echelon supply chain network design with trade credit ⋮ Optimizing the supply chain configuration for make-to-order manufacturing ⋮ Multi-echelon inventory optimization for practitioners: a predictive global sensitivity analysis approach ⋮ A typology and literature review on stochastic multi-echelon inventory models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling and constraint propagation
- Efficient heuristics for inventory placement in acyclic networks
- A generic arc-consistency algorithm and its specializations
- Supply chain partnerships: Opportunities for operations research
- Dynamic programming algorithms for multi-stage safety stock optimization
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Lower bounds for resource-constrained project scheduling problems.
- Project scheduling. A research handbook.
- Inventory positioning in multiple product supply chains
- Strategic safety stocks in supply chains
- A constraint programming framework for local search methods
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Solving VRPTWs with constraint programming based column generation
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Logic, Optimization, and Constraint Programming
- A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
- Optimizing the Supply Chain Configuration for New Products
- Critical-Path Planning and Scheduling: Mathematical Basis
- Objective function approximations in mathematical programming
- Application of a Technique for Research and Development Program Evaluation
- Computationally Related Problems
- In-Process Inventories
- Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
- Constraint programming and operations research: comments from an operations researcher
