{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T06:55:09Z","timestamp":1675925709319},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,16]],"date-time":"2010-07-16T00:00:00Z","timestamp":1279238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10100-010-0155-6","type":"journal-article","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T05:38:49Z","timestamp":1279172329000},"page":"1-17","source":"Crossref","is-referenced-by-count":3,"title":["An approximate algorithm for optimal logistics of heavy and variable size items"],"prefix":"10.1007","volume":"20","author":[{"given":"Lorenzo","family":"Ros-McDonnell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Victoria","family":"de-la-Fuente-Aragon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marija","family":"Bogataj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,16]]},"reference":[{"key":"155_CR1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.ejor.2005.01.035","volume":"173","author":"M Albareda-Sambola","year":"2006","unstructured":"Albareda-Sambola M, van der Vlerk M, Fern\u00e1ndez E (2006) Exact solutions to a class of stochastic generalized assignment problems. Eur J Oper Res 173: 465\u2013487","journal-title":"Eur J Oper Res"},{"issue":"2","key":"155_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0377-2217(94)00154-5","volume":"5","author":"M Amini","year":"1995","unstructured":"Amini M, Racer M (1995) A hybrid heuristic for the generalized assignment problem. Eur J Oper Res 5(2): 343\u2013350","journal-title":"Eur J Oper Res"},{"key":"155_CR3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/S0895-7177(00)00258-2","volume":"33","author":"L Caccetta","year":"2001","unstructured":"Caccetta L, Hill SP (2001) Branch and cut methods for network optimization. Math Comp Model 33: 517\u2013532","journal-title":"Math Comp Model"},{"key":"155_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0377-2217(90)90300-Z","volume":"46","author":"D Cattryse","year":"1990","unstructured":"Cattryse D, Van Wassenhove L (1990) A survey of algorithms for the generalized assignment problem. Eur J Oper Res 46: 84\u201392","journal-title":"Eur J Oper Res"},{"key":"155_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","volume":"72","author":"D Cattryse","year":"1994","unstructured":"Cattryse D, Salomon M, Van Wassenhove L (1994) A set partitioning heuristics for the generalized assignment problem. Eur J Oper Res 72: 167\u2013174","journal-title":"Eur J Oper Res"},{"key":"155_CR6","unstructured":"Clausen J, (1999) B&B Algorithms\u2014principles and examples. http:\/\/www.imada.sdu.dk . Accessed 10 June 2008"},{"key":"155_CR7","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1016\/j.cor.2004.03.013","volume":"32","author":"S Dunstall","year":"2005","unstructured":"Dunstall S, Wirth A (2005a) Heuristic methods for the identical parallel machine flowtime problem with set-up times. Comput Oper Res 32: 2479\u20132491","journal-title":"Comput Oper Res"},{"key":"155_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.ejor.2004.03.022","volume":"167","author":"S Dunstall","year":"2005","unstructured":"Dunstall S, Wirth A (2005b) A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur J Oper Res 167: 283\u2013296","journal-title":"Eur J Oper Res"},{"issue":"1","key":"155_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1080\/00207549308956723","volume":"31","author":"JF Ferreira","year":"1993","unstructured":"Ferreira JF, Pradin B (1993) A methodology for cellular manufacturing design. Int J Prod Res 31(1): 235\u2013250","journal-title":"Int J Prod Res"},{"issue":"9","key":"155_CR10","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher ML, Jaikumar R, Van Wassenhove L (1986) A multiplier adjustment method for the generalized assignment problem. Manage Sci 32(9): 1095\u20131103","journal-title":"Manage Sci"},{"key":"155_CR11","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.cor.2003.08.021","volume":"32","author":"VC Li","year":"2005","unstructured":"Li VC, Curry GL (2005) Solving multidimensional knapsack problems with generalized upper bound constraints using critical event taboo search. Comput Oper Res 32: 825\u2013848","journal-title":"Comput Oper Res"},{"key":"155_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"C Li","year":"2005","unstructured":"Li C, Vairaktarakis G, Lee C (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164: 39\u201351","journal-title":"Eur J Oper Res"},{"issue":"3","key":"155_CR13","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","volume":"91","author":"LA Lorena","year":"1996","unstructured":"Lorena LA, Narciso N, Marcelo G (1996) Relaxation heuristics for a generalized assignment problem. Eur J Oper Res 91(3): 600\u2013607","journal-title":"Eur J Oper Res"},{"key":"155_CR14","unstructured":"Martello S, Toth P (1981) An algorithm for the generalized assignment problem. In: Proceedings of the 9th IFORS Conference, Hamburg, Germany"},{"key":"155_CR15","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.disopt.2006.11.002","volume":"4","author":"L McLay","year":"2007","unstructured":"McLay L, Jacobson S (2007) Algorithms for the bounded set-up knapsack problem. Discrete Optim 4: 206\u2013212","journal-title":"Discrete Optim"},{"key":"155_CR16","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S0377-2217(02)00576-3","volume":"151","author":"M Osorio","year":"2003","unstructured":"Osorio M, Laguna M (2003) Logic cuts for multilevel generalized assignment problems. Eur J Oper Res 151: 238\u2013246","journal-title":"Eur J Oper Res"},{"key":"155_CR17","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"M Pereira","year":"2007","unstructured":"Pereira M, Valerio JM (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176: 1508\u20131527","journal-title":"Eur J Oper Res"},{"key":"155_CR18","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0167-8191(03)00045-0","volume":"29","author":"TK Ralphs","year":"2003","unstructured":"Ralphs TK (2003) Parallel branch and cut for capacitated vehicle routing. Parallel Comput 29: 607\u2013629","journal-title":"Parallel Comput"},{"key":"155_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0954-1810(99)00004-7","volume":"13","author":"MJ Realff","year":"1999","unstructured":"Realff MJ, Kvam PH, Taylor WE (1999) Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem. Artif Intell Eng 13: 287\u2013300","journal-title":"Artif Intell Eng"},{"key":"155_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"GT Ross","year":"1975","unstructured":"Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8: 91\u2013103","journal-title":"Math Program"},{"key":"155_CR21","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.trb.2005.05.005","volume":"40","author":"S Rouillon","year":"2006","unstructured":"Rouillon S, Desaulniers G, Soumis F (2006) An extended branch-and-bound method for locomotive assignment. Transport Res B-Meth 40: 404\u2013423","journal-title":"Transport Res B-Meth"},{"key":"155_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","volume":"99","author":"D Tahar","year":"2006","unstructured":"Tahar D, Yalaoui F, Chu C, Amadeo L (2006) A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. Int J Prod Econ 99: 63\u201373","journal-title":"Int J Prod Econ"},{"key":"155_CR23","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0377-2217(99)00453-1","volume":"125","author":"P Toth","year":"2000","unstructured":"Toth P (2000) Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems. Eur J Oper Res 125: 222\u2013238","journal-title":"Eur J Oper Res"},{"key":"155_CR24","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1016\/j.cor.2004.04.002","volume":"32","author":"X Wang","year":"2005","unstructured":"Wang X, Cheng TCE (2005) Two-machine flowshop scheduling with job class setups to minimize total flowtime. Comput Oper Res 32: 2751\u20132770","journal-title":"Comput Oper Res"},{"key":"155_CR25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.advengsoft.2006.06.003","volume":"38","author":"C Zhang","year":"2007","unstructured":"Zhang C, Ong H (2007) An efficient solution to biobjective generalized assignment problem. Adv Eng Softw 38: 50\u201358","journal-title":"Adv Eng Softw"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-010-0155-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-010-0155-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-010-0155-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:27Z","timestamp":1559108967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-010-0155-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,16]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s10100-010-0155-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,16]]}}}