References
- AksoyYErengucSSMulti-item inventory models with coordinated replenishments: A surveyInt J Prod Mngt19888637310.1108/eb054814
- AtkinsDIyogunPA heuristic with lower bound performance guarantee for the multi-product lot-size problemIIE Trans198820369373
- BlackburnJDMillenRAHeuristic lot-sizing performance in a rolling schedule environmentDecis Sci19801169170110.1111/j.1540-5915.1980.tb01170.x
- BoctorFFLaporteGRenaudJModels and algorithms for the dynamic demand joint replenishment problemInt J Prod Res2004422667267810.1080/00207540410001671660
- DixonPSSilverEAA heuristic solution procedure for the multi-item, single-level, limited capacity, lot sizing problemJ Opns Mngt198122339
- DogramaciAPanayiotopoulosJCAdamNRThe dynamic lot sizing problem for multiple items under limited capacityAIIE Trans19811329430310.1080/05695558108974565
- EisenhutPSA dynamic lot sizing algorithm with capacity constraintsAIIE Trans1975717017610.1080/05695557508974999
- ErengucSSMulti-product dynamic lot-sizing model with coordinated replenishmentsNav Res Logist19883512210.1002/nav.3220350102
- FedergruenATzurMThe joint replenishment problem with the time-varying costs and demands: efficient, asymptotic and ɛ-optimal solutionsOpns Res1994421067108610.1287/opre.42.6.1067
- FogartyDBarringerRJoint order release decisions under dependent demandProd Invent Mngt J19872815561
- FungRYKMaXA new method for joint replenishment problemsJ Opl Res Soc20015235836210.1057/palgrave.jors.2601091
- HillierFSLiebermanGJIntroduction to Operations Research2005
- IyogunPHeuristic methods for the multi-product dynamic lot size problemJ Opl Res Soc19914288989410.1057/jors.1991.169
- KaoEPCA multi-product dynamic lot-size model with individual and joint setup costsOpns Res19792727928910.1287/opre.27.2.279
- KircaOA primal-dual algorithm for the dynamic lot-sizing problem with joint setup costsNav Res Logist19954279180610.1002/1520-6750(199508)42:5<791::AID-NAV3220420506>3.0.CO;2-8
- JonejaDThe joint replenishment problem: new heuristics and worst case performance boundsOpns Res19903871172310.1287/opre.38.4.711
- LambrechtMRVandervekenHHeuristic procedures for the single operations, multi-item loading problemAIIE Trans19791131932610.1080/05695557908974478
- NarayananARobinsonEPMore on ‘Models and algorithms for the dynamic-demand joint replenishment problem’Int J Prod Res20064438339710.1080/00207540500270562
- Raghavan P (1993). The multi-item lot sizing problem with joint replenishments. PhD Dissertation. Leonard N. Stern School of Business, New York University.
- RobinsonEPGaoLA dual ascent procedure for multi-product dynamic demand coordinated replenishment with backloggingMngt Sci1996421556156410.1287/mnsc.42.11.1556
- RobinsonEPLawrenceFBCoordinated capacitated lot-sizing problem with dynamic demand: a lagrangian heuristicDecis Sci200435255410.1111/j.1540-5414.2004.02396.x
- SilverEACoordinated replenishments of items under time varying demand: dynamic programming formulationNav Res Logist Q19792614115110.1002/nav.3800260113
- SilverEKellePMore on ‘Joint order release decisions under dependent demand’Prod Invent Mngt J1988297172
- SilverEAMealHCA heuristic for selecting lot size quantities for the case of a deterministic time varying demand rate and discrete opportunities for replenishmentProd Invent Mngt J1973146474
- ViswanathanSA new optimal algorithm for the joint replenishment problemJ Opl Res Soc19964793694410.1057/jors.1996.119
- ViswanathanSOn optimal algorithms for the joint replenishment problemJ Opl Res Soc2002531286129010.1057/palgrave.jors.2601445
- WagnerHMWhitinTMDynamic version of economic lot size modelMngt Sci19585899610.1287/mnsc.5.1.89
- ZangwillWIA deterministic multiproduct, multifacility production and inventory systemOpns Res19661448650710.1287/opre.14.3.486