{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T19:13:05Z","timestamp":1768158785398,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T00:00:00Z","timestamp":1255392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10479-009-0642-0","type":"journal-article","created":{"date-parts":[[2009,10,12]],"date-time":"2009-10-12T21:10:58Z","timestamp":1255381858000},"page":"405-427","source":"Crossref","is-referenced-by-count":39,"title":["Bidirectional best-fit heuristic for orthogonal rectangular strip packing"],"prefix":"10.1007","volume":"172","author":[{"given":"\u00d6nder Bar\u0131\u015f","family":"A\u015f\u0131k","sequence":"first","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,13]]},"reference":[{"issue":"4","key":"642_CR1","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. (2008). Reactive GRASP for the strip-packing problem. Computers & Operations Research, 35(4), 1065\u20131083.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"642_CR2","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209064","volume":"9","author":"B. S. Baker","year":"1980","unstructured":"Baker, B. S., Coffman, E. G., & Rivest, R. L., Jr. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4), 808\u2013826.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"642_CR3","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. (1985a). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33(1), 49\u201364.","journal-title":"Operations Research"},{"issue":"4","key":"642_CR4","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. (1985b). Algorithms for unconstrained two-dimensional guillotine cutting. Journal of Operations Research Society, 36(4), 297\u2013306.","journal-title":"Journal of Operations Research Society"},{"key":"642_CR5","unstructured":"Beltr\u00e1n, J. D., Calder\u00f3n, J. E., Cabrera, R. J., Moreno-P\u00e9rez, J. A., & Moreno-Vega, J. M. (2004). GRASP-VNS hybrid for the strip packing problem. In Proceeding of the workshop on hybrid metaheuristics (pp.\u00a079\u201390)."},{"issue":"3","key":"642_CR6","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A. Bortfeld","year":"2006","unstructured":"Bortfeld, A. (2006). A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research, 172(3), 814\u2013837.","journal-title":"European Journal of Operational Research"},{"key":"642_CR7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"E. Burke","year":"2003","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., & Schulenburg, S. (2003). Hyper-heuristics: An emerging direction in modem search technology. In Handbook of metaheuristics (pp. 457\u2013474). Dordrecht: Kluwer Academic."},{"issue":"4","key":"642_CR8","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. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 52(4), 655\u2013671.","journal-title":"Operations Research"},{"key":"642_CR9","unstructured":"Burke, E. K., Kendall, G., & Whitwell, G. (2006). Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem (Technical Report No NOTTCS-TR-2006-3). University of Nottingham, Computer Science."},{"issue":"3","key":"642_CR10","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. (2009). A simulated annealing enhancements of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS Journal on Computing, 21(3), 505\u2013516.","journal-title":"INFORMS Journal on Computing"},{"issue":"8","key":"642_CR11","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"C-32","author":"B. Chazelle","year":"1983","unstructured":"Chazelle, B. (1983). The bottom-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers, C-32(8), 697\u2013707.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"642_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1018517106992","volume":"8","author":"C. H. Dagli","year":"1997","unstructured":"Dagli, C. H., & Poshyanonda, P. (1997). New approaches to nesting rectangular patterns. Journal of Intelligent Manufacturing, 8(3), 177\u2013190.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"642_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K. A. Dowsland","year":"1992","unstructured":"Dowsland, K. A., & Dowsland, W. B. (1992). Packing problems. European Journal of Operational Research, 56(1), 2\u201314.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"642_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44(2), 145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"642_CR15","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. New York: Freeman."},{"key":"642_CR16","doi-asserted-by":"crossref","unstructured":"Garrido, P., & Riff, M.-C. (2007). An evolutionary hyperheuristic to solve strip-packing problems. In Proceedings of the intelligent data engineering and automated learning\u2014IDEAL 2007 (pp.\u00a0406\u2013415)","DOI":"10.1007\/978-3-540-77226-2_42"},{"issue":"2","key":"642_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"R. W. H\u00e4ssler","year":"1991","unstructured":"H\u00e4ssler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research, 54(2), 141\u2013150.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"642_CR18","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0377-2217(80)90068-5","volume":"5","author":"A. I. Hinxman","year":"1980","unstructured":"Hinxman, A. I. (1980). The trim loss and assortment problems: A survey. European Journal of Operational Research, 5(1), 8\u201318.","journal-title":"European Journal of Operational Research"},{"key":"642_CR19","unstructured":"Hopper, E. (2000). Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. PhD thesis, Cardiff University, School of Engineering."},{"key":"642_CR20","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. C. H. (2001a). An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128, 34\u201357.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"642_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., & Turton, B. C. H. (2001b). A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review, 16(4), 257\u2013300.","journal-title":"Artificial Intelligence Review"},{"key":"642_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","volume":"37","author":"S. Imahori","year":"2010","unstructured":"Imahori, S., & Yagiura, M. (2010). The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Computers & Operations Research, 37, 325\u2013333.","journal-title":"Computers & Operations Research"},{"key":"642_CR23","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. (2005). Improved local search algorithms for the rectangle packing problem with general spatial costs. European Journal of Operational Research, 167, 48\u201367.","journal-title":"European Journal of Operational Research"},{"key":"642_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S. Jakobs","year":"1996","unstructured":"Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88, 165\u2013181.","journal-title":"European Journal of Operational Research"},{"key":"642_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. (2009). Exact algorithms for the 2-dimensional strip packing problem with and without rotations. European Journal of Operational Research, 198, 73\u201383.","journal-title":"European Journal of Operational Research"},{"key":"642_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., McMahon, A., & Mitzenmacher, M. (2004). Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters, 90, 7\u201314.","journal-title":"Information Processing Letters"},{"key":"642_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1064546.1083322","volume":"10","author":"N. Lesh","year":"2005","unstructured":"Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2005). New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics, 10, 1\u201318.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"642_CR28","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D. Liu","year":"1999","unstructured":"Liu, D., & Teng, H. (1999). An improved bottom left algorithm for genetic algorithm of the orthogonal packing of rectangle. European Journal of Operational Research, 112, 413\u2013419.","journal-title":"European Journal of Operational Research"},{"key":"642_CR29","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11, 345\u2013357.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"642_CR30","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241\u2013252.","journal-title":"European Journal of Operational Research"},{"key":"642_CR31","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44, 388\u2013399.","journal-title":"Management Science"},{"issue":"3","key":"642_CR32","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. (2003). An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15(3), 310\u2013319.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"642_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E. \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., & Korkmaz, E. E. (2008). A comprehensive analysis of hyper-heuristics. Intelligent Data Analysis, 12(1), 3\u201323.","journal-title":"Intelligent Data Analysis"},{"key":"642_CR34","unstructured":"Pinto, E., & Oliveira, J. F. (2005). Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. In 2nd ESICUP meeting, Southampton."},{"issue":"7","key":"642_CR35","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1080\/002075499191166","volume":"37","author":"A. Ramesh Babu","year":"1999","unstructured":"Ramesh Babu, A., & Ramesh Babu, N. (1999). Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research, 37(7), 1625\u20131643.","journal-title":"International Journal of Production Research"},{"key":"642_CR36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1115\/1.3185882","volume":"104","author":"S. C. Sarin","year":"1983","unstructured":"Sarin, S. C. (1983). Two-dimensional stock cutting problems and solution methodologies. ASME Transactions Journal of Engineering for Industry, 104, 155\u2013160.","journal-title":"ASME Transactions Journal of Engineering for Industry"},{"key":"642_CR37","doi-asserted-by":"crossref","unstructured":"Terashima-Marin, H., Flores-Alvarez, E. J., & Ross, P. (2005a). Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In Proceedings of the genetic and evolutionary computation conference (vol. 2, pp. 637\u2013643).","DOI":"10.1145\/1068009.1068115"},{"key":"642_CR38","doi-asserted-by":"crossref","unstructured":"Terashima-Marin, H., Moran-Saavedra, A., & Ross, P. (2005b). Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems. In Proceedings of the IEEE congress on evolutionary computation (vol. 2, pp. 1104\u20131110).","DOI":"10.1109\/CEC.2005.1554814"},{"key":"642_CR39","unstructured":"Valenzuela, C. L., & Wang, P. Y. (2001). Heuristics for large strip packing problems with guillotine patterns: An empirical study. In Proceedings of the 4th metaheuristics international conference (pp. 417\u2013421). University of Porto, Porto, Portugal."},{"key":"642_CR40","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. Waescher","year":"2007","unstructured":"Waescher, G., Haussner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"642_CR41","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"D. Zhang","year":"2006","unstructured":"Zhang, D., Kang, Y., & Deng, A. (2006). A new heuristic recursive algorithm for the strip rectangular packing problem. Computers & Operations Research, 33, 2209\u20132217.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0642-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0642-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0642-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T04:51:11Z","timestamp":1634014271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0642-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,13]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0642-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,13]]}}}