{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:36:23Z","timestamp":1725600983876},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232190"},{"type":"electronic","value":"9783642232206"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23220-6_81","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:37:47Z","timestamp":1313584667000},"page":"638-643","source":"Crossref","is-referenced-by-count":0,"title":["A Bricklaying Best-Fit Heuristic Algorithm for the Orthogonal Rectangle Packing Problem"],"prefix":"10.1007","author":[{"given":"Wenshui","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jinping","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jiandong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xinyou","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"81_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E. Coffman Jr.","year":"1978","unstructured":"Coffman Jr., E., Garey, M., Johnson, D.: An application of bin packing to multiprocessor scheduling. SIAM Journal on Computing\u00a07(1), 1\u201317 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"81_CR2","first-page":"49","volume-title":"Algorithm Design for Computer System Design","author":"E. Coffman","year":"1984","unstructured":"Coffman, E., Garey, M., Johason, D.: Approximation algorithms for bin packing problems \u2013 An update survey. In: Ausiello, G., Lucertini, M., Serafini, P. (eds.) Algorithm Design for Computer System Design, pp. 49\u2013106. Springer, New York (1984)"},{"issue":"1","key":"81_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(89)90031-7","volume":"38","author":"E. Coffman Jr.","year":"1989","unstructured":"Coffman Jr., E., Leighton, F.: A provably efficient algorithm for dynamic storage allocation. Journal of Computer and System Sciences\u00a038(1), 2\u201335 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"81_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research\u00a044(2), 145\u2013159 (1990)","journal-title":"European Journal of Operational Research"},{"key":"81_CR5","first-page":"85","volume":"57","author":"A. Paull","year":"1956","unstructured":"Paull, A.: Linear programming: A key to optimum newsprint production. Pulp Paper Magazine of Canada\u00a057, 85\u201390 (1956)","journal-title":"Pulp Paper Magazine of Canada"},{"issue":"1","key":"81_CR6","doi-asserted-by":"publisher","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. Operations Research\u00a025(1), 30\u201344 (1977)","journal-title":"Operations Research"},{"issue":"1","key":"81_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J. Beasley","year":"1985","unstructured":"Beasley, J.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research\u00a033(1), 49\u201364 (1985)","journal-title":"Operations Research"},{"key":"81_CR8","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B. Baker","year":"1980","unstructured":"Baker, B., Coffman, E., Rivest, R.L.: Orthogonal packing in two dimensions. SIAM Journal on Computing\u00a09, 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"81_CR9","doi-asserted-by":"publisher","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.\u00a032(8), 697\u2013707 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"81_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D. Liu","year":"1999","unstructured":"Liu, D., Teng, H.: An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. European Journal of Operational Reseach\u00a0112(2), 413\u2013420 (1999)","journal-title":"European Journal of Operational Reseach"},{"issue":"4","key":"81_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E. Burke","year":"2004","unstructured":"Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operatations Research\u00a052(4), 655\u2013671 (2004)","journal-title":"Operatations Research"},{"issue":"3","key":"81_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.3724\/SP.J.1016.2008.00509","volume":"31","author":"D. Zhang","year":"2008","unstructured":"Zhang, D., Han, S., Jiang, Y.: A personification heuristic algorithm for the orthogonal stock-cutting problem. Chinese Journal of Computers\u00a031(3), 509\u2013513 (2008) (in Chinese)","journal-title":"Chinese Journal of Computers"},{"issue":"4","key":"81_CR13","first-page":"379","volume":"20","author":"D. Chen","year":"2008","unstructured":"Chen, D., Liu, J., Shang, M.: An intelligent enumerative algorithm for solving rectangle packing problem. Journal of Chongqing University of Post and Telecommunications (Natural Science)\u00a020(4), 379\u2013384 (2008) (in Chinese)","journal-title":"Journal of Chongqing University of Post and Telecommunications (Natural Science)"},{"issue":"1","key":"81_CR14","doi-asserted-by":"publisher","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 algorithms for a 2D packing problem. European Journal of Operational Research\u00a0128(1), 34\u201357 (2001)","journal-title":"European Journal of Operational Research"}],"container-title":["Communications in Computer and Information Science","Applied Informatics and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23220-6_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:25:19Z","timestamp":1554045919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23220-6_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232190","9783642232206"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23220-6_81","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}