Models and algorithms for the dynamic-demand joint replenishment problem
From MaRDI portal
Publication:4671273
DOI10.1080/00207540410001671660zbMath1059.90005OpenAlexW2061326657MaRDI QIDQ4671273
Jacques Renaud, Gilbert Laporte, Fayez F. Boctor
Publication date: 26 April 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540410001671660
Related Items
Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem, The inventory replenishment planning and staggering problem: a bi-objective approach, A tabu search heuristic for the multi-depot vehicle routing problem, Efficient methods for stochastic joint replenishment and delivery problem, Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model, Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation, Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research, Medium term production management for cyclic deliveries, A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks, The dynamic-demand joint replenishment problem with approximated transportation costs, A review of the joint replenishment problem literature: 1989--2005, Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories, Data-driven assignment of delivery patterns with handling effort considerations in retail, A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies, More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’, Efficient and effective heuristics for the coordinated capacitated lot-size problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem
Cites Work
- Computational complexity of uncapacitated multi-echelon production planning problems
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Dynamic Version of the Economic Lot Size Model
- Multiproduct dynamic lot-sizing model with coordinated replenishments
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
