{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T07:06:56Z","timestamp":1714547216514},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T00:00:00Z","timestamp":1338336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10732-012-9203-9","type":"journal-article","created":{"date-parts":[[2012,5,29]],"date-time":"2012-05-29T15:00:53Z","timestamp":1338303653000},"page":"677-697","source":"Crossref","is-referenced-by-count":7,"title":["A heuristic algorithm for the strip packing problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Jianli","family":"Chen","sequence":"first","affiliation":[]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,30]]},"reference":[{"issue":"3","key":"9203_CR1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R. Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A tabu search algorithm for two-dimensional non-guillotine cutting problems. Eur. J. Oper. Res. 183(3), 1167\u20131182 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9203_CR2","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R. Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: Reactive grasp for the strip packing problem. Comput. Oper. Res. 35(4), 1065\u20131083 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9203_CR3","first-page":"431","volume":"31","author":"R. Alvarez-Valdes","year":"2009","unstructured":"Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A branch and bound algorithm for the strip packing problem. Comput. Oper. Res. 31(4), 431\u2013459 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9203_CR4","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-79438-7_3","volume-title":"Adaptive and Multilevel Metaheuristics","author":"I. Araya","year":"2008","unstructured":"Araya, I., Neveu, B., Riff, M.C.: An efficient hyperheuristic for strip packing problems. In: Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol.\u00a0136, pp.\u00a061\u201377 (2008)"},{"issue":"1","key":"9203_CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10479-009-0642-0","volume":"172","author":"O.B. Asik","year":"2009","unstructured":"Asik, O.B., Ozcan, E.: Bidirectional best-fit heuristic for orthogonal rectangular strip packing problem. Ann. Oper. Res. 172(1), 405\u2013427 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9203_CR6","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9203_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36(4), 297\u2013306 (1985a)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9203_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49\u201364 (1985b)","journal-title":"Oper. Res."},{"issue":"3","key":"9203_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"B.E. Bengtsson","year":"1982","unstructured":"Bengtsson, B.E.: Packing rectangular pieces-a heuristic approach. Comput. J. 25(3), 353\u2013357 (1982)","journal-title":"Comput. J."},{"issue":"4","key":"9203_CR10","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52(4), 655\u2013671 (2004)","journal-title":"Oper. Res."},{"issue":"3","key":"9203_CR11","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"E.K. Burke","year":"2009","unstructured":"Burke, E.K., Kendall, G., Whitwell, G.: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS J. Comput. 21(3), 505\u2013516 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"9203_CR12","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.cor.2010.10.005","volume":"38","author":"E.K. Burke","year":"2011","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: A squeaky wheel optimisation methodology for two-dimensional strip packing. Comput. Oper. Res. 38(7), 1035\u20131044 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9203_CR13","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32","author":"B. Chazelle","year":"1983","unstructured":"Chazelle, B.: The bottom left bin packing heuristic: an efficient implementation. IEEE Trans. Comput. 32(8), 697\u2013707 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"9203_CR14","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TSMCC.2010.2066560","volume":"41","author":"J. Chen","year":"2011","unstructured":"Chen, J., Zhu, W.X., Ali, M.M.: A hybrid simulated annealing algorithm for non-slicing VLSI floorplanning. IEEE Trans. Syst. Man Cybern., Part C, Appl. Rev. 41(4), 544\u2013553 (2011)","journal-title":"IEEE Trans. Syst. Man Cybern., Part C, Appl. Rev."},{"issue":"1","key":"9203_CR15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25(1), 30\u201344 (1977)","journal-title":"Oper. Res."},{"issue":"1","key":"9203_CR16","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman","year":"1980","unstructured":"Coffman, E.G., Garey, D., Tarjan, R.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM J. Comput. 9(1), 808\u2013826 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9203_CR17","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.cor.2006.08.011","volume":"35","author":"Y. Cui","year":"2008","unstructured":"Cui, Y.: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Comput. Oper. Res. 35(4), 1281\u20131291 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9203_CR18","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-540-77226-2_42","volume-title":"Proceedings of the Intelligent Data Engineering and Automated Learning","author":"P. Garrido","year":"2007","unstructured":"Garrido, P., Riff, M.C.: An evolutionary hyperheuristic to solve strip-packing problems. In: Proceedings of the Intelligent Data Engineering and Automated Learning, pp. 406\u2013415 (2007)"},{"key":"9203_CR19","unstructured":"Heidi, S.: The NFDH Algorithm (2012a). [online Available]. http:\/\/users.cs.cf.ac.uk\/C.L.Mumford\/heidi\/NFDHquarters.html"},{"key":"9203_CR20","unstructured":"Heidi, S.: The FFDH Algorithm (2012b). [online Available]. http:\/\/users.cs.cf.ac.uk\/C.L.Mumford\/heidi\/FFDHquarters.html"},{"issue":"1","key":"9203_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.: An empirical investigation of meta-heuristic and heuristic algorithm for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34\u201357 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9203_CR22","doi-asserted-by":"crossref","first-page":"3270","DOI":"10.1016\/j.cor.2005.12.005","volume":"34","author":"W. Huang","year":"2007","unstructured":"Huang, W., Chen, D., Xu, R.: A new heuristic algorithm for rectangle packing. Comput. Oper. Res. 34(11), 3270\u20133280 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9203_CR23","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1109\/ICSMC.1994.400073","volume-title":"Proceeding of IEEE International Conference on Systems, Man, and Cybernetics","author":"S.M. Hwang","year":"1994","unstructured":"Hwang, S.M., Kao, C.Y., Horng, J.T.: On solving rectangle bin packing problems using genetic algorithms. In: Proceeding of IEEE International Conference on Systems, Man, and Cybernetics, pp. 1583\u20131590 (1994)"},{"issue":"1","key":"9203_CR24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.ejor.2004.02.020","volume":"167","author":"S. Imahori","year":"2005","unstructured":"Imahori, S., Yagiura, M., Ibaraki, T.: Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1), 48\u201367 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9203_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"M. Kenmochi","year":"2009","unstructured":"Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact algorithms for the 2-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1), 73\u201383 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9203_CR26","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N. Lesh","year":"2004","unstructured":"Lesh, N., Marks, J., Mahon, A.M., Mitzenmacher, M.: Exhaustive approaches to 2D rectangular perfect packings. Inf. Process. Lett. 90(1), 7\u201314 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9203_CR27","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S. Martello","year":"2003","unstructured":"Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS J. Comput. 15(3), 310\u2013319 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9203_CR28","first-page":"521","volume-title":"Proceedings of the Conference on Design, Automation and Test in Europe","author":"X. Tang","year":"2001","unstructured":"Tang, X., Wong, D.F.: FAST-SP: a fast algorithm for block placement based on sequence pair. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 521\u2013526 (2001)"},{"issue":"5","key":"9203_CR29","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.cor.2008.03.004","volume":"36","author":"L. Wei","year":"2009","unstructured":"Wei, L., Zhang, D., Chen, Q.: A least wasted first heuristic algorithm for rectangular packing problem. Comput. Oper. Res. 36(5), 1608\u20131614 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9203_CR30","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/762488.762490","volume":"8","author":"G.M. Wu","year":"2003","unstructured":"Wu, G.M., Chang, Y.C., Chang, W.Y.: Rectilinear block placement using B*-trees. ACM Trans. Des. Autom. Electron. Syst. 8(2), 188\u2013202 (2003)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9203-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9203-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9203-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9203-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,30]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9203"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9203-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,30]]}}}