{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:23:10Z","timestamp":1768288990164,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T00:00:00Z","timestamp":1488412800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10288-017-0344-4","type":"journal-article","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T10:00:56Z","timestamp":1488448856000},"page":"31-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Block rearranging elements within matrix columns to minimize the variability of the row sums"],"prefix":"10.1007","volume":"16","author":[{"given":"Kris","family":"Boudt","sequence":"first","affiliation":[]},{"given":"Edgars","family":"Jakobsons","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0511-1044","authenticated-orcid":false,"given":"Steven","family":"Vanduffel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,2]]},"reference":[{"key":"344_CR1","doi-asserted-by":"crossref","unstructured":"Alvim AC and Ribeiro CC (2004) A hybrid bin-packing heuristic to multiprocessor scheduling. In: International workshop on experimental and efficient algorithms. Springer, Berlin, pp 1\u201313","DOI":"10.1007\/978-3-540-24838-5_1"},{"key":"344_CR2","doi-asserted-by":"publisher","unstructured":"Bernard C, McLeish D (2016) Algorithms for finding copulas minimizing convex functions of sums. Asia Pac J Oper Res 33(5):1650040. doi: 10.1142\/S0217595916500408","DOI":"10.1142\/S0217595916500408"},{"key":"344_CR3","doi-asserted-by":"publisher","unstructured":"Bernard C, R\u00fcschendorf L, Vanduffel S (2015) Value-at-risk bounds with variance constraints. J Risk Insur. doi: 10.1111\/jori.12108","DOI":"10.1111\/jori.12108"},{"issue":"6","key":"344_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/1351847X.2015.1104370","volume":"23","author":"C Bernard","year":"2017","unstructured":"Bernard C, R\u00fcschendorf L, Vanduffel S, Yao J (2017) How robust is the value-at-risk of credit risk portfolios? Eur J Financ 23(6):507\u2013534","journal-title":"Eur J Financ"},{"issue":"2","key":"344_CR5","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0047-259X(88)90052-8","volume":"25","author":"PJ Boland","year":"1988","unstructured":"Boland PJ, Proschan F (1988) Multivariate arrangement increasing functions with applications in probability and statistics. J Multivar Anal 25(2):286\u2013298","journal-title":"J Multivar Anal"},{"issue":"1\u20133","key":"344_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S Chopra","year":"1993","unstructured":"Chopra S, Rao MR (1993) The partition problem. Math Program 59(1\u20133):87\u2013115","journal-title":"Math Program"},{"issue":"3","key":"344_CR7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/moor.9.3.384","volume":"9","author":"E Coffman","year":"1984","unstructured":"Coffman E, Yannakakis M (1984) Permuting elements within columns of a matrix in order to minimize maximum row sum. Math Oper Res 9(3):384\u2013390","journal-title":"Math Oper Res"},{"issue":"5","key":"344_CR8","doi-asserted-by":"crossref","first-page":"930","DOI":"10.4153\/CJM-1972-093-x","volume":"24","author":"PW Day","year":"1972","unstructured":"Day PW (1972) Rearrangement inequalities. Can J Math 24(5):930\u2013943","journal-title":"Can J Math"},{"issue":"2","key":"344_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7(2):191\u2013200","journal-title":"ORSA J Comput"},{"issue":"2","key":"344_CR10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.ejor.2004.06.002","volume":"160","author":"M Dell\u2019Amico","year":"2005","unstructured":"Dell\u2019Amico M, Martello S (2005) A note on exact algorithms for the identical parallel machine scheduling problem. Eur J Oper Res 160(2):576\u2013578","journal-title":"Eur J Oper Res"},{"issue":"3","key":"344_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.1070.0246","volume":"20","author":"M Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico M, Iori M, Martello S, Monaci M (2008) Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J Comput 20(3):333\u2013344","journal-title":"INFORMS J Comput"},{"issue":"8","key":"344_CR12","doi-asserted-by":"crossref","first-page":"2750","DOI":"10.1016\/j.jbankfin.2013.03.014","volume":"37","author":"P Embrechts","year":"2013","unstructured":"Embrechts P, Puccetti G, R\u00fcschendorf L (2013) Model uncertainty and VaR aggregation. J Bank Financ 37(8):2750\u20132764","journal-title":"J Bank Financ"},{"issue":"2","key":"344_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/B:JOCO.0000031420.05971.29","volume":"8","author":"A Frangioni","year":"2004","unstructured":"Frangioni A, Necciari E, Scutella MG (2004) A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J Comb Optim 8(2):195\u2013220","journal-title":"J Comb Optim"},{"issue":"3","key":"344_CR14","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1111\/0824-7935.00069","volume":"14","author":"IP Gent","year":"1998","unstructured":"Gent IP, Walsh T (1998) Analysis of heuristics for number partitioning. Comput Intell 14(3):430\u2013451","journal-title":"Comput Intell"},{"issue":"9","key":"344_CR15","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45(9):1563\u20131581","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"344_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1511\/2002.2.113","volume":"90","author":"B Hayes","year":"2002","unstructured":"Hayes B (2002) Computing science: the easiest hard problem. Am Sci 90(2):113\u2013117","journal-title":"Am Sci"},{"issue":"3","key":"344_CR17","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/moor.9.3.376","volume":"9","author":"W-L Hsu","year":"1984","unstructured":"Hsu W-L (1984) Approximation algorithms for the assembly line crew scheduling problem. Math Oper Res 9(3):376\u2013383","journal-title":"Math Oper Res"},{"key":"344_CR18","doi-asserted-by":"crossref","unstructured":"Jakobsons E, Wang R (2016) Negative dependence in matrix arrangement problems. http:\/\/ssrn.com\/abstract=2756934","DOI":"10.2139\/ssrn.2756934"},{"key":"344_CR19","unstructured":"Karmarkar N, Karp RM (1982) The differencing method of set partitioning. Technical Report UCB\/CSD 82\/113, Computer Science Division, University of California, Berkeley"},{"issue":"2","key":"344_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(98)00086-1","volume":"106","author":"RE Korf","year":"1998","unstructured":"Korf RE (1998) A complete anytime algorithm for number partitioning. Artif Intell 106(2):181\u2013203","journal-title":"Artif Intell"},{"key":"344_CR21","doi-asserted-by":"crossref","unstructured":"Marshall AW, Olkin I, Arnold BC (2011) Inequalities: theory of majorization and its applications, 2nd edn. Springer, New York","DOI":"10.1007\/978-0-387-68276-1"},{"issue":"20","key":"344_CR22","doi-asserted-by":"crossref","first-page":"4281","DOI":"10.1103\/PhysRevLett.81.4281","volume":"81","author":"S Mertens","year":"1998","unstructured":"Mertens S (1998) Phase transition in the number partitioning problem. Phys Rev Lett 81(20):4281","journal-title":"Phys Rev Lett"},{"issue":"3","key":"344_CR23","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","volume":"152","author":"E Mokotoff","year":"2004","unstructured":"Mokotoff E (2004) An exact algorithm for the identical parallel machine scheduling problem. Eur J Oper Res 152(3):758\u2013769","journal-title":"Eur J Oper Res"},{"issue":"7","key":"344_CR24","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1016\/j.cam.2011.10.015","volume":"236","author":"G Puccetti","year":"2012","unstructured":"Puccetti G, R\u00fcschendorf L (2012) Computation of sharp bounds on the distribution of a function of dependent risks. J Comput Appl Math 236(7):1833\u20131840","journal-title":"J Comput Appl Math"},{"issue":"4","key":"344_CR25","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1214\/15-STS525","volume":"30","author":"G Puccetti","year":"2015","unstructured":"Puccetti G, Wang R (2015) Extremal dependence concepts. Stat Sci 30(4):485\u2013517","journal-title":"Stat Sci"},{"key":"344_CR26","doi-asserted-by":"crossref","unstructured":"R\u00fcschendorf L (2013) Mathematical risk analysis. In: Mikosch TV, Resnick SI, Robinson SM (eds) Springer Series in Operations Research and Financial Engineering. Springer, Heidelberg","DOI":"10.1007\/978-3-642-33590-7"},{"key":"344_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-34675-5","volume-title":"Stochastic orders","author":"M Shaked","year":"2007","unstructured":"Shaked M, Shanthikumar JG (2007) Stochastic orders. Springer, Berlin"},{"issue":"10","key":"344_CR28","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.jmva.2011.05.002","volume":"102","author":"B Wang","year":"2011","unstructured":"Wang B, Wang R (2011) The complete mixability and convex minimization problems with monotone marginal densities. J Multivar Anal 102(10):1344\u20131360","journal-title":"J Multivar Anal"},{"issue":"3","key":"344_CR29","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/moor.2015.0755","volume":"41","author":"B Wang","year":"2016","unstructured":"Wang B, Wang R (2016) Joint mixability. Math Oper Res 41(3):808\u2013826","journal-title":"Math Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0344-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0344-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0344-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T03:26:59Z","timestamp":1568863619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0344-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0344-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,2]]}}}