Boctor, F. F., Laporte, G., & Renaud, J. (2004). Models and algorithms for the dynamic-demand joint replenishment problem. International Journal of Production Research, 42, 2667 - 2678. Bookbinder, J. H., & Tan, J.-Y. (1988). Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints. Management Science, 34(9), 1096-1108. https://doi.org/10.1287/mnsc.34.9.1096 Eisenhut, P. S. (1975). A Dynamic Lot Sizing Algorithm with Capacity Constraints. A I I E Transactions, 7(2), 170-176. https://doi.org/10.1080/05695557508974999 Erenguc, S. S. (1988). Multiproduct dynamic lot-sizing model with coordinated replenishments. Naval Research Logistics (NRL), 35(1), 1-22. https://doi.org/https://doi.org/10.1002/nav.3220350102 Federgruen, A., & Tzur, M. (1994). The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions. Operations Research, 42(6), 1067-1086. https://doi.org/10.1287/opre.42.6.1067 Fogarty, D. W., & Barringer, R. L. (1987). Joint order release decisions under dependent demand [Article]. Production and inventory management Washington, D.C., 28(1), 55-61. Goyal, S. K. (1973). Determination of Economic Packaging Frequency for Items Jointly Replenished. Management Science, 20, 232-235. Iyogun, P. (1991). Heuristic Methods for the Multi-product Dynamic Lot Size Problem. Journal of the Operational Research Society, 42(10), 889-894. https://doi.org/10.1057/jors.1991.169 Joneja, D. (1990). The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds. Operations Research, 38(4), 711-723. https://doi.org/10.1287/opre.38.4.711 Kao, E. P. C. (1979). A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs. Operations Research, 27(2), 279-289. https://doi.org/10.1287/opre.27.2.279 Lambrecht, M. R., & Vanderveken, H. (1979). Heuristic Procedures for the Single Operation, Multi-Item Loading Problem. A I I E Transactions, 11(4), 319-326. https://doi.org/10.1080/05695557908974478 Ma, X., Rossi, R., & Archibald, T. W. (2022). Approximations for non-stationary stochastic lot-sizing under (s,Q)-type policy. European Journal of Operational Research, 298(2), 573-584. https://doi.org/10.1016/j.ejor.2021.06.013 Özen, U., Doğru, M. K., & Armagan Tarim, S. (2012). Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem. Omega, 40(3), 348-357. https://doi.org/10.1016/j.omega.2011.08.002 Robinson, E. P., & Gao, L.-L. (1996). A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging. Management Science, 42, 1556-1564. Robinson, E. P., Narayanan, A., & Gao, L. L. (2007). Effective heuristics for the dynamic demand joint replenishment problem. Journal of the Operational Research Society, 58(6), 808-815. https://doi.org/10.1057/palgrave.jors.2602197 Silver, E. (1978). Inventory control under a probabilistic time-varying, demand pattern. A I I E Transactions, 10(4), 371-379. https://doi.org/10.1080/05695557808975228 Silver E, K. P. (1988). More on ‘Joint order release decisions under dependent demand. Prod Invent Mngt J(29), 71-72. Tarim, S. A., Dogˇru, M. K., Özen, U., & Rossi, R. (2011). An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints. European Journal of Operational Research, 215(3), 563-571. https://doi.org/10.1016/j.ejor.2011.06.034 Tarim, S. A., & Kingsman, B. G. (2004). The stochastic dynamic production/inventory lot-sizing problem with service-level constraints. International Journal of Production Economics, 88(1), 105-119. https://doi.org/10.1016/s0925-5273(03)00182-8 Tarim, S. A., & Kingsman, B. G. (2006). Modelling and computing (Rn,Sn) policies for inventory systems with non-stationary stochastic demand. European Journal of Operational Research, 174(1), 581-599. https://doi.org/10.1016/j.ejor.2005.01.053 Tempelmeier, H. (2007). On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints. European Journal of Operational Research, 181(1), 184-194. https://doi.org/10.1016/j.ejor.2006.06.009 ter Haseborg, F. (1982). On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs. European Journal of Operational Research, 9(1), 47-55. https://doi.org/https://doi.org/10.1016/0377-2217(82)90009-1 Tunc, H., Kilic, O. A., Tarim, S. A., & Rossi, R. (2018). An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem. INFORMS Journal on Computing, 30(3), 492-506. https://doi.org/10.1287/ijoc.2017.0792 Visentin, A., Prestwich, S., Rossi, R., & Tarim, S. A. (2021). Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming. European Journal of Operational Research, 294(1), 91-99. https://doi.org/10.1016/j.ejor.2021.01.012 Visentin, A., Prestwich, S., Rossi, R., & Tarim, S. A. (2023). Stochastic dynamic programming heuristic for the (R,s,S) policy parameters computation. Computers & Operations Research, 158. https://doi.org/10.1016/j.cor.2023.106289 Wagner, H. M., & Whitin, T. M. (1958). Dynamic Version of the Economic Lot Size Model. Management Science, 5(1), 89-96. https://doi.org/10.1287/mnsc.5.1.89 Xiang, M., Rossi, R., Martin-Barragan, B., & Tarim, S. A. (2018). Computing non-stationary (s, S) policies using mixed integer linear programming. European Journal of Operational Research, 271(2), 490-500. https://doi.org/10.1016/j.ejor.2018.05.030