{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:29:37Z","timestamp":1778549377099,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001858","name":"VINNOVA","doi-asserted-by":"publisher","award":["2017-04845"],"award-info":[{"award-number":["2017-04845"]}],"id":[{"id":"10.13039\/501100001858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002835","name":"Chalmers University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002835","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a tri-objective mixed-integer linear programming model of the tactical resource allocation problem with inventories, called the <jats:italic>generalized tactical resource allocation problem<\/jats:italic> (GTRAP). We propose a specialized criterion space decomposition strategy, in which the projected two-dimensional criterion space is partitioned and the corresponding sub-problems are solved in parallel by application of the <jats:italic>quadrant shrinking method<\/jats:italic> (QSM) (Boland in Eur J Oper Res 260(3):873\u2013885, 2017) for identifying non-dominated points. To obtain an efficient implementation of the parallel variant of the QSM we suggest some modifications to reduce redundancies. Our approach is tailored for the GTRAP and is shown to have superior computational performance as compared to using the QSM without parallelization when applied to industrial instances.<\/jats:p>","DOI":"10.1007\/s10287-023-00442-6","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T13:03:51Z","timestamp":1679922231000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A criterion space decomposition approach to generalized tri-objective tactical resource allocation"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7748-1821","authenticated-orcid":false,"given":"Sunney","family":"Fotedar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1962-7279","authenticated-orcid":false,"given":"Ann-Brith","family":"Str\u00f6mberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torgny","family":"Almgren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Cedergren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,27]]},"reference":[{"key":"442_CR1","doi-asserted-by":"crossref","unstructured":"Bixby R, Cook W, Cox A, Lee E (1999) Computational experience with parallel mixed integer programming in a distributed environment. Annal Oper Res 90:19\u201343. https:\/\/doi.org\/cg7gh9","DOI":"10.1023\/A:1018960631213"},{"key":"442_CR2","doi-asserted-by":"crossref","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015) The L-shape search method for triobjective integer programming. Math Prog Comput 8(2):217\u2013251. https:\/\/doi.org\/hbtm","DOI":"10.1007\/s12532-015-0093-3"},{"key":"442_CR3","doi-asserted-by":"crossref","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2017) The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs. Eur J Oper Res 260(3):873\u2013885. https:\/\/doi.org\/ftpq","DOI":"10.1016\/j.ejor.2016.03.035"},{"key":"442_CR4","doi-asserted-by":"crossref","unstructured":"Bradley JR, Glynn PW (2002) Managing capacity and inventory jointly in manufacturing systems. Manag Sci 48(2):273\u2013288. https:\/\/doi.org\/bm3pr5","DOI":"10.1287\/mnsc.48.2.273.254"},{"key":"442_CR5","doi-asserted-by":"crossref","unstructured":"Ceyhan G, \u00a0K\u00f6ksalan M and \u00a0Lokman B (2019) Finding a representative nondominated set for multi-objective mixed integer programs. Eur J Oper Res\u00a0272(1): 61\u201377. https:\/\/doi.org\/jccf","DOI":"10.1016\/j.ejor.2018.06.012"},{"key":"442_CR6","doi-asserted-by":"crossref","unstructured":"Chen SP and Huang WL (2010) A membership function approach for aggregate production planning problems in fuzzy environments. Int J Prod Res\u00a048: 7003\u20137023. https:\/\/doi.org\/chbpvb","DOI":"10.1080\/00207540903246649"},{"key":"442_CR7","doi-asserted-by":"crossref","unstructured":"Dhaenens C, Lemesre J, Melab N, Mezmaz MS and Talbi EG (2006) Parallel exact methods for multiobjective combinatorial optimization. Wiley Series on Parallel and Distributed Computing, 187\u2013210. Wiley https:\/\/doi.org\/dw97rm","DOI":"10.1002\/9780470053928.ch8"},{"key":"442_CR8","doi-asserted-by":"crossref","unstructured":"D\u00edaz-Madro\u00f1ero M, \u00a0Mula J and \u00a0Peidro D (2014) A review of discrete-time optimization models for tactical production planning. Int J Prod Res\u00a052(17): 5171\u20135205. https:\/\/doi.org\/ftpt","DOI":"10.1080\/00207543.2014.899721"},{"key":"442_CR9","doi-asserted-by":"crossref","unstructured":"D\u00e4chert K and Klamroth K (2014) A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J Glob Optimiz\u00a061(4): 643\u2013676. https:\/\/doi.org\/f659q7","DOI":"10.1007\/s10898-014-0205-z"},{"key":"442_CR10","doi-asserted-by":"crossref","unstructured":"D\u00e4chert K, Klamroth K, Lacour R and Vanderpooten D (2017) Efficient computation of the search region in multi-objective optimization. Eur J Oper Res\u00a0260(3): 841\u2013855. https:\/\/doi.org\/gbg9","DOI":"10.1016\/j.ejor.2016.05.029"},{"key":"442_CR11","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13180","author":"S Fotedar","year":"2022","unstructured":"Fotedar S, Str\u00f6mberg A-B, Almgren T (2022) Bi-objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.13180","journal-title":"Int Trans Oper Res"},{"key":"442_CR12","doi-asserted-by":"crossref","unstructured":"Genin P, \u00a0Lamouri S and Thomas A (2008) Multi-facilities tactical planning robustness with experimental design. Prod Plan Control\u00a019(2): 171\u2013182. https:\/\/doi.org\/dgfdxd","DOI":"10.1080\/09537280801896250"},{"key":"442_CR13","doi-asserted-by":"crossref","unstructured":"Kirlik G and Say\u0131n S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur J Oper Res\u00a0232(3): 479\u2013488. https:\/\/doi.org\/ftpr","DOI":"10.1016\/j.ejor.2013.08.001"},{"key":"442_CR14","doi-asserted-by":"crossref","unstructured":"Klamroth K, \u00a0Lacour R and Vanderpooten D (2015) On the representation of the search region in multi-objective optimization. Eur J Oper Res 245(3): 767\u2013778. https:\/\/doi.org\/h2w6","DOI":"10.1016\/j.ejor.2015.03.031"},{"key":"442_CR15","doi-asserted-by":"crossref","unstructured":"Lan Y, Zhao R and Tang W (2011) Minimum risk criterion for uncertain production planning problems. Comput Ind Eng\u00a061(3): 591\u2013599. https:\/\/doi.org\/b5ffz9","DOI":"10.1016\/j.cie.2011.04.014"},{"key":"442_CR16","doi-asserted-by":"crossref","unstructured":"Laumanns M, Thiele L and Zitzler E (2006) An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur J Oper Res\u00a0169(3): 932\u2013942. https:\/\/doi.org\/dn45j3","DOI":"10.1016\/j.ejor.2004.08.029"},{"key":"442_CR17","doi-asserted-by":"crossref","unstructured":"Lemesre J, Dhaenens C and Talbi E (2007) An exact parallel method for a bi-objective permutation flowshop problem. Eur J Oper Res\u00a0177(3): 1641\u20131655. https:\/\/doi.org\/d7xhgx","DOI":"10.1016\/j.ejor.2005.10.011"},{"key":"442_CR18","doi-asserted-by":"crossref","unstructured":"Mieghem JAV (2003) Capacity management, investment, and hedging: Review and recent developments. Manuf Serv Oper Manag\u00a05(4): 269\u2013302. https:\/\/doi.org\/dhx6pz","DOI":"10.1287\/msom.5.4.269.24882"},{"key":"442_CR19","doi-asserted-by":"crossref","unstructured":"Nourelfath M (2011) Service level robustness in stochastic production planning under random machine breakdowns. Eur J Oper Res\u00a0212(1): 81\u201388. https:\/\/doi.org\/chbswp","DOI":"10.1016\/j.ejor.2011.01.032"},{"key":"442_CR20","doi-asserted-by":"crossref","unstructured":"\u00d6zlen M,Burton BA and MacRae CAG (2013) Multi-objective integer programming: an improved recursive algorithm. J Optimiz Theory Appl\u00a0160(2): 470\u2013482. https:\/\/doi.org\/f5vxmg","DOI":"10.1007\/s10957-013-0364-y"},{"key":"442_CR21","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming. Springer, New York"},{"key":"442_CR22","doi-asserted-by":"crossref","unstructured":"Talbi EG, Mostaghim S,\u00a0Okabe T, Ishibuchi H, Rudolph G and Coello\u00a0Coello CA 2008. Parallel Approaches for Multiobjective Optimization, pp. 349\u2013372. Berlin, Heidelberg: Springer Berlin Heidelberg","DOI":"10.1007\/978-3-540-88908-3_13"},{"key":"442_CR23","doi-asserted-by":"crossref","unstructured":"Ulungu EL and Teghem J (1994) Multi-objective combinatorial optimization problems: a survey. J Multi-Criteria Decis Anal\u00a03(2): 83\u2013104. https:\/\/doi.org\/b2g9vz","DOI":"10.1002\/mcda.4020030204"},{"key":"442_CR24","doi-asserted-by":"crossref","unstructured":"Wei C, Li Y and Cai X (2011) Robust optimal policies of production and inventory with uncertain returns and demand. Int J Prod Econ\u00a0134(2): 357\u2013367. https:\/\/doi.org\/bv67qg","DOI":"10.1016\/j.ijpe.2009.11.008"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00442-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00442-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00442-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T21:41:17Z","timestamp":1701466877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00442-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["442"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00442-6","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"1 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}