{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:17:45Z","timestamp":1725981465181},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319943060"},{"type":"electronic","value":"9783319943077"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94307-7_1","type":"book-chapter","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T13:28:33Z","timestamp":1529414913000},"page":"3-17","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Set-Associated Bin Packing Algorithm with Multiple Objectives in the Cloud"],"prefix":"10.1007","author":[{"given":"Fei","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"Edward G. Coffman","year":"2013","unstructured":"Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Handbook of Combinatorial Optimization, pp. 455\u2013531. Kluwer Academic Publishers (2013)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cie.2014.06.002","volume":"75","author":"T Dokeroglu","year":"2014","unstructured":"Dokeroglu, T., Cosar, A.: Optimization of one-dimensional bin packing problem with island parallel grouping genetic algorithms. Comput. Ind. Eng. 75, 176\u2013186 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"1_CR3","series-title":"International Centre for Mechanical Sciences","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-7091-2748-3_8","volume-title":"Analysis and Design of Algorithms in Combinatorial Optimization","author":"MR Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing problems: a survey. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms in Combinatorial Optimization. ICMS, vol. 266, pp. 147\u2013172. Springer, Vienna (1981). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-2748-3_8"},{"issue":"6","key":"1_CR4","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1007\/s13369-014-1052-4","volume":"39","author":"B Naderi","year":"2014","unstructured":"Naderi, B., Yazdani, M.: A real multi-objective bin packing problem: a case study of an engine assembly line. Arab. J. Sci. Eng. 39(6), 5271\u20135277 (2014)","journal-title":"Arab. J. Sci. Eng."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1240233.1240245","volume":"3","author":"J Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3, 1\u201324 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"2572","DOI":"10.1016\/j.tcs.2010.03.019","volume":"411","author":"J Boyar","year":"2010","unstructured":"Boyar, J., Epstein, L., Levin, A.: Tight results for next fit and worst fit with resource augmentation. Theor. Comput. Sci. 411, 2572\u20132580 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR7","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"issue":"7","key":"1_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., Jurgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1_CR9","first-page":"111","volume":"19","author":"P Schwerin","year":"1999","unstructured":"Schwerin, P., Wscher, G.: A new lower bound for the bin-packing problem and its integration into MTP and bison. Pesqui. Op. 19, 111\u2013129 (1999)","journal-title":"Pesqui. Op."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JM Valerio Carvalho de","year":"1999","unstructured":"de Valerio Carvalho, J.M.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86, 629\u2013659 (1999)","journal-title":"Ann. Oper. Res."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1080\/095372899232894","volume":"10","author":"JND Gupta","year":"1999","unstructured":"Gupta, J.N.D., Ho, J.C.: A new heuristic algorithm for the one-dimensional bin packing problem. Prod. Plann. Control 10, 598\u2013603 (1999)","journal-title":"Prod. Plann. Control"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29, 821\u2013839 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"13","key":"1_CR13","doi-asserted-by":"publisher","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"Masson, R., Vidal, T., Michallet, J., Penna, P.H.V., Petrucci, V., Subramanian, A., et al.: An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40(13), 5266\u20135275 (2013)","journal-title":"Expert Syst. Appl."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24838-5_1","volume-title":"Experimental and Efficient Algorithms","author":"ACF Alvim","year":"2004","unstructured":"Alvim, A.C.F., Ribeiro, C.C.: A Hybrid bin-packing heuristic to multiprocessor scheduling. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 1\u201313. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24838-5_1"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00291-006-0071-2","volume":"29","author":"A Singh","year":"2007","unstructured":"Singh, A., Gupta, A.K.: Two heuristics for the one-dimensional bin-packing problem. OR Spectr. 29(4), 765\u2013781 (2007)","journal-title":"OR Spectr."},{"issue":"7","key":"1_CR16","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2006.10.021","volume":"35","author":"KH Loh","year":"2008","unstructured":"Loh, K.H., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Comput. Oper. Res. 35(7), 2283\u20132291 (2008)","journal-title":"Comput. Oper. Res."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"Fleszar, K., Charalambous, C.: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur. J. Oper. Res. 210, 176\u2013184 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jim\u00e9nez, J., GomezSantill, C., Huacuja, H.J.F., Alvim, A.C.F.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015)","journal-title":"Comput. Oper. Res."},{"key":"1_CR19","unstructured":"Brando, F., Pedroso, J.P.: Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression, Technical Report DCC-2013-08, Faculdade de Ci\u00eanciasda Universidadedo Porto, Portugal (2013)"}],"container-title":["Lecture Notes in Computer Science","Cognitive Computing \u2013 ICCC 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94307-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T13:28:45Z","timestamp":1529414925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94307-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319943060","9783319943077"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94307-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}