{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:45Z","timestamp":1740141885929,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:00:00Z","timestamp":1510790400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science and Engineering Research Council of Canada (NSERC)","award":["OPG0036509"],"award-info":[{"award-number":["OPG0036509"]}]},{"DOI":"10.13039\/100007867","name":"Universit\u00e9 Laval","doi-asserted-by":"publisher","award":["96139"],"award-info":[{"award-number":["96139"]}],"id":[{"id":"10.13039\/100007867","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10288-017-0362-2","type":"journal-article","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T05:52:21Z","timestamp":1510811541000},"page":"199-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The inventory replenishment planning and staggering problem: a bi-objective approach"],"prefix":"10.1007","volume":"16","author":[{"given":"Fayez F.","family":"Boctor","sequence":"first","affiliation":[]},{"given":"Marie-Claude","family":"Bolduc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"362_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/opre.39.2.233","volume":"39","author":"S Anily","year":"1991","unstructured":"Anily S (1991) Multi-item replenishment and storage problem (MIRSP): heuristics and bounds. Oper Res 39:233\u2013243","journal-title":"Oper Res"},{"key":"362_CR2","first-page":"389","volume":"19","author":"FF Boctor","year":"1985","unstructured":"Boctor FF (1985) Single machine lot scheduling: a comparison of some solution procedures. RA IRO Autom Prod Inf Ind 19:389\u2013402","journal-title":"RA IRO Autom Prod Inf Ind"},{"key":"362_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/00207548708919847","volume":"25","author":"FF Boctor","year":"1987","unstructured":"Boctor FF (1987) The G-group heuristic for single machine lot scheduling. Int J Prod Res 25:363\u2013379","journal-title":"Int J Prod Res"},{"key":"362_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ejor.2009.07.035","volume":"203","author":"FF Boctor","year":"2010","unstructured":"Boctor FF (2010) Offsetting inventory replenishment cycles to minimize storage space. Eur J Oper Res 203:321\u2013325","journal-title":"Eur J Oper Res"},{"key":"362_CR5","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1080\/00207540410001671660","volume":"42","author":"FF Boctor","year":"2004","unstructured":"Boctor FF, Laporte G, Renaud J (2004) Models and algorithms for the dynamic demand joint replenishment problem. Int J Prod Res 42:2667\u20132678","journal-title":"Int J Prod Res"},{"key":"362_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00291-008-0150-7","volume":"32","author":"L Buschk\u00fchl","year":"2010","unstructured":"Buschk\u00fchl L, Sahling F, Helber S, Templemeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32:231\u2013261","journal-title":"OR Spectrum"},{"key":"362_CR7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"362_CR8","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1287\/mnsc.39.7.872","volume":"39","author":"M El-Najdawi","year":"1993","unstructured":"El-Najdawi M, Kleindorfer PR (1993) Common cycle lot-size scheduling for multi-product, multi-stage production. Manag Sci 39:872\u2013885","journal-title":"Manag Sci"},{"key":"362_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(92)90021-T","volume":"12","author":"G Gallego","year":"1992","unstructured":"Gallego G, Shaw D, Simchi-Levi D (1992) The complexity of the staggering problem and other classical inventory problems. Oper Res Lett 12:47\u201352","journal-title":"Oper Res Lett"},{"key":"362_CR10","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1287\/opre.44.4.580","volume":"44","author":"G Gallego","year":"1996","unstructured":"Gallego G, Queyranne M, Simchi-Levi D (1996) Single resource multi-item inventory systems. Oper Res 44:580\u2013595","journal-title":"Oper Res"},{"key":"362_CR11","first-page":"269","volume":"29","author":"SK Goyal","year":"1978","unstructured":"Goyal SK (1978) A note on multi-production inventory situation with one restriction. J Oper Res Soc 29:269\u2013271","journal-title":"J Oper Res Soc"},{"key":"362_CR12","first-page":"245","volume":"18","author":"NG Hall","year":"1988","unstructured":"Hall NG (1988) A comparison of inventory replenishment heuristics for minimizing maximum storage. Am J Math Manag Sci 18:245\u2013258","journal-title":"Am J Math Manag Sci"},{"key":"362_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1080\/07408179608966257","volume":"28","author":"MA Hariga","year":"1996","unstructured":"Hariga MA, Jackson PL (1996) The warehouse scheduling problem: formulation and algorithm. IIE Trans 28:115\u2013127","journal-title":"IIE Trans"},{"key":"362_CR14","doi-asserted-by":"crossref","unstructured":"Harris FW (1913) How many parts to make at once. Oper Res 38:947\u2013950 (reprint from Fact Mag Manag 10, 135\u201336, 152)","DOI":"10.1287\/opre.38.6.947"},{"key":"362_CR15","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1057\/jors.1982.212","volume":"33","author":"R Hartley","year":"1982","unstructured":"Hartley R, Thomas LC (1982) The deterministic, two-product, inventory with capacity constraint. J Oper Res Soc 33:1013\u20131020","journal-title":"J Oper Res Soc"},{"key":"362_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365\u2013378","journal-title":"Omega"},{"key":"362_CR17","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/s001580100138","volume":"22","author":"E Kasprzak","year":"2001","unstructured":"Kasprzak E, Lewis K (2001) Pareto analysis in multi-objective optimization using the colinearity theorem and scaling method. Struct Multidiscip Optim 22:208\u2013218","journal-title":"Struct Multidiscip Optim"},{"key":"362_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.03.007","volume":"186","author":"M Khouja","year":"2008","unstructured":"Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989\u20132005. Eur J Oper Res 186:1\u201316","journal-title":"Eur J Oper Res"},{"key":"362_CR19","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.ress.2005.11.018","volume":"91","author":"A Konak","year":"2006","unstructured":"Konak A, Coit DW, Smith AE (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992\u20131007","journal-title":"Reliab Eng Syst Saf"},{"key":"362_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369\u2013395","journal-title":"Struct Multidiscip Optim"},{"key":"362_CR21","first-page":"245","volume":"15","author":"IK Moon","year":"2008","unstructured":"Moon IK, Cha BC, Kim SK (2008) Offsetting inventory cycles using mixed integer programming and genetic algorithm. Int J Ind Eng 15:245\u2013256","journal-title":"Int J Ind Eng"},{"key":"362_CR22","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0377-2217(02)00518-0","volume":"150","author":"NN Murthy","year":"2003","unstructured":"Murthy NN, Benton WC, Rubin PA (2003) Offsetting inventory cycles of items sharing storage. Eur J Oper Res 150:304\u2013319","journal-title":"Eur J Oper Res"},{"key":"362_CR23","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1080\/002075498193552","volume":"36","author":"J Ouenniche","year":"1998","unstructured":"Ouenniche J, Boctor FF (1998) Sequencing, lot sizing and scheduling of several products in job shops: the common cycle approach. Int J Prod Res 36:1125\u20131140","journal-title":"Int J Prod Res"},{"key":"362_CR24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/00207540150208871","volume":"39","author":"J Ouenniche","year":"2001","unstructured":"Ouenniche J, Boctor FF (2001) The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops. Int J Prod Res 39:81\u201398","journal-title":"Int J Prod Res"},{"key":"362_CR25","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1057\/jors.1976.172","volume":"27","author":"E Page","year":"1976","unstructured":"Page E, Paul RJ (1976) Multi-production inventory situation with one restriction. J Oper Res Soc 27:815\u2013834","journal-title":"J Oper Res Soc"},{"key":"362_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.omega.2006.11.004","volume":"37","author":"P Robinson","year":"2009","unstructured":"Robinson P, Narayananb A, Sahin F (2009) Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms. Omega 37:3\u201315","journal-title":"Omega"},{"key":"362_CR27","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.38.4.686","volume":"38","author":"MJ Rosenblatt","year":"1990","unstructured":"Rosenblatt MJ, Rothblum UG (1990) On the single resource capacity problem for multi-item inventory systems. Oper Res 38:686\u2013693","journal-title":"Oper Res"},{"key":"362_CR28","volume-title":"Inventory management and production planning and scheduling","author":"E Silver","year":"1998","unstructured":"Silver E, Pyke D, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, London","edition":"3"},{"key":"362_CR29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1057\/jors.1983.10","volume":"34","author":"LC Thomas","year":"1983","unstructured":"Thomas LC, Hartley R (1983) An algorithm for the limited capacity inventory problem with staggering. J Oper Res Soc 34:81\u201385","journal-title":"J Oper Res Soc"},{"key":"362_CR30","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"DA Veldhuizen Van","year":"2000","unstructured":"Van Veldhuizen DA, Lamont GB (2000) Multi-objective evolutionary algorithms: analyzing the state of the art. Evol Comput 8:125\u2013147","journal-title":"Evol Comput"},{"key":"362_CR31","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner HM, Whitin TM (1958) Dynamic version of economic lot size model. Manag Sci 5:89\u201396","journal-title":"Manag Sci"},{"key":"362_CR32","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.omega.2007.01.007","volume":"36","author":"MJ Yao","year":"2008","unstructured":"Yao MJ, Chu WM (2008) A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements. Omega 36:619\u2013631","journal-title":"Omega"},{"key":"362_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multi objective evolutionary algorithms: empirical results. Evolut Comput 8:173\u2013195","journal-title":"Evolut Comput"},{"key":"362_CR34","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA 2: improving the strength Pareto evolutionary algorithm, TIK report 103. Swiss Federal Institute of Technology, Zurich"},{"key":"362_CR35","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/mnsc.24.4.451","volume":"24","author":"K Zoller","year":"1977","unstructured":"Zoller K (1977) Deterministic multi-item inventory systems with limited capacity. Manag Sci 24:451\u2013455","journal-title":"Manag Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0362-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0362-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0362-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T02:29:49Z","timestamp":1570328989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0362-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0362-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2017,11,16]]}}}