The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

References

• Anily S (1991) Multi-item replenishment and storage problem (MIRSP): Heuristics and bounds. Oper. Res. 39(2):233–243.Link, Google Scholar
• Boctor FF (2010) Offsetting inventory replenishment cycles to minimize storage space. Eur. J. Oper. Res. 203(2):321–325.Crossref, Google Scholar
• Boctor FF, Bolduc MC (2015) Inventory replenishment planning and staggering. IFAC PapersOnLine 48(3):1416–1421.Crossref, Google Scholar
• Croot E, Huang K (2013) A class of random algorithms for inventory cycle offsetting. Internat. J. Oper. Res. 18(2):201–217.Crossref, Google Scholar
• Gallego G, Queyranne M, Simchi-Levi D (1996) Single resource multi-item inventory systems. Oper. Res. 44(4):580–595.Link, Google Scholar
• Gallego G, Shaw D, Simchi-Levi D (1992) The complexity of the staggering problem, and other classical inventory problems. Oper. Res. Lett. 12(1):47–52.Crossref, Google Scholar
• Gary MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Co., New York).Google Scholar
• Hall NG (1998) A comparison of inventory replenishment heuristics for minimizing maximum storage. Amer. J. Math. Management Sci. 18(3–4):245–258.Crossref, Google Scholar
• Hariga MA, Jackson PL (1995) Time-variant lot sizing models for the warehouse scheduling problem. IIE Trans. 27(2):162–170.Crossref, Google Scholar
• Hariga MA, Jackson PL (1996) The warehouse scheduling problem: Formulation and algorithms. IIE Trans. 28(2):115–127.Crossref, Google Scholar
• Hartley R, Thomas LC (1982) The deterministic, two-product, inventory system with capacity constraint. J. Oper. Res. Soc. 33(11):1013–1020.Crossref, Google Scholar
• Homer E (1966) Space-limited aggregate inventories with phased deliveries. J. Indust. Engrg. 17(6):327–333.Google Scholar
• Moon IK, Cha BC, Kim SK (2008) Offsetting inventory cycles using mixed integer programming and genetic algorithm. Internat. J. Indust. Engrg. Theory Appl. Practice 15(3):245–256.Google Scholar
• Murthy NN, Benton WC, Rubin PA (2003) Offsetting inventory cycles of items sharing storage. Eur. J. Oper. Res. 150(2):304–319.Crossref, Google Scholar
• Page E, Paul RJ (1976) Multi-production inventory situation with one restriction. J. Oper. Res. Soc. 27(4):815–834.Crossref, Google Scholar
• Russell RA, Urban TL (2016) Offsetting inventory replenishment cycles. Eur. J. Oper. Res. 254(1):105–112.Crossref, Google Scholar
• Teo CP, Ou J, Tan KC (1998) Multi-item inventory staggering problems: Heuristics and bounds. Proc. Ninth Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 584–593.Google Scholar
• Thomas LC, Hartley R (1983) An algorithm for limited capacity inventory problem with staggering. J. Oper. Res. Soc. 34(1):81–85.Crossref, Google Scholar
• Yao MJ, Chu WM (2008) A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements. Omega 36(4):619–631.Crossref, Google Scholar
• Yao MJ, Chu WM, Lin YF (2008) Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule. Comput. Oper. Res. 35(10):3230–3242.Crossref, Google Scholar
• Zoller K (1977) Deterministic multi-item inventory systems with limited capacity. Management Sci. 24(4):451–455.Link, Google Scholar