Title
Effective heuristics for the dynamic demand joint replenishment problem
Abstract
This paper considers the dynamic demand joint replenishment problem where there is a joint setup cost in each time period when any member of the product family is replenished and a separate setup cost for each different item replenished. We present two forward-pass heuristics, a two-phase heuristic, and a simulated annealing metaheuristic (SAM) and investigate their relative effectiveness in solving a comprehensive set of test problems. The experimental results indicate the two-phase heuristic and the SAM perform better than existing approaches for the problem.
Year
DOI
Venue
2007
10.1057/palgrave.jors.2602197
JORS
Keywords
Field
DocType
scheduling,communications technology,location,production,forecasting,project management,computer science,marketing,operations research,investment,management science,operational research,reliability,inventory,logistics,information systems,information technology
Simulated annealing,Heuristic,Computer science,Scheduling (computing),Operations research,Dynamic demand,Heuristics,Modular design,Operations management,Metaheuristic,Project management
Journal
Volume
Issue
ISSN
58
6
0160-5682
Citations 
PageRank 
References 
3
0.42
7
Authors
3
Name
Order
Citations
PageRank
E P Robinson130.42
A Narayanan230.42
Li-Lian Gao3191.53