Effective heuristics for the dynamic demand joint replenishment problem

DOI10.1057/PALGRAVE.JORS.2602197MaRDI QIDQ5428976zbMATH OpenOpenAlexFDO

Authors

Publication date 29 November 2007

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602197

zbMATH Keywords

dynamic demandinventoryjoint replenishment

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’
• Models and algorithms for the dynamic-demand joint replenishment problem
• The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
• Two New Heuristic Procedures for the Joint Replenishment Problem
• The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions

Cited in

(16)

• Efficient and effective heuristics for the coordinated capacitated lot-size problem
• The dynamic-demand joint replenishment problem with approximated transportation costs
• A dynamic joint replenishment policy with auto-correlated demand
• Modeling and optimization of stochastic joint replenishment and delivery scheduling problem with uncertain costs
• The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
• A simple improvement on Silver's heuristic for the joint replenishment problem
• Dynamic lot sizing for multiple products with a new joint replenishment model
• Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments
• Two New Heuristic Procedures for the Joint Replenishment Problem
• Cyclical schedules for the joint replenishment problem with dynamic demands
• Models and algorithms for the dynamic-demand joint replenishment problem
• The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
• More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’
• Uncapacitated multi-item lot sizing with shipment minimization
• 2-approximation algorithms for two variants of the static stochastic joint replenishment problem
• A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: advantages of meta-heuristics

This page was built for publication: Effective heuristics for the dynamic demand joint replenishment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428976)