{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:33Z","timestamp":1740099633301,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811527661"},{"type":"electronic","value":"9789811527678"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-981-15-2767-8_21","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:02:35Z","timestamp":1579964555000},"page":"221-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Heuristic-Dynamic Programming Algorithm for Rectangular Cutting Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5559-1555","authenticated-orcid":false,"given":"Aihua","family":"Yin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9631-237X","authenticated-orcid":false,"given":"Chong","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6645-0595","authenticated-orcid":false,"given":"Dongping","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4577-1346","authenticated-orcid":false,"given":"Jianghai","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2985-657X","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,26]]},"reference":[{"issue":"9\u201312","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s00170-011-3351-1","volume":"57","author":"Y Liu","year":"2011","unstructured":"Liu, Y., Chu, C., Wang, K.: A new heuristic algorithm for a class of two-dimensional bin-packing problems. Int. J. Adv. Manuf. Technol. 57(9\u201312), 1235\u20131244 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.orl.2006.07.001","volume":"35","author":"F Clautiaux","year":"2007","unstructured":"Clautiaux, F., Jouglet, A., Hayek, J.E.: A new lower bound for the non-oriented two-dimensional bin-packing problem. Oper. Res. Lett. 35(3), 365\u2013373 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"21_CR3","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.H., Ye, W.G.: A bricklaying heuristic algorithm for the orthogonal rectangular packing problem. Chin. J. Comput. 31(3), 509\u2013515 (2008)","journal-title":"Chin. J. Comput."},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR5","first-page":"1640","volume":"28","author":"W Lei","year":"2017","unstructured":"Lei, W., Qiang, L., Xin, C.: Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem. J. Softw. 28, 1640\u20131654 (2017)","journal-title":"J. Softw."},{"issue":"1","key":"21_CR6","first-page":"125","volume":"18","author":"YD Cui","year":"2006","unstructured":"Cui, Y.D.: Recursive algorithm for generating optimal T-shape cutting patterns of rectangular blanks. J. Comput. Aided Des. Comput. Graph. 18(1), 125 (2006)","journal-title":"J. Comput. Aided Des. Comput. Graph."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.ejor.2009.05.047","volume":"202","author":"X Song","year":"2010","unstructured":"Song, X., Chu, C.B., Lewis, R., et al.: A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. Eur. J. Oper. Res. 202(2), 368\u2013378 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1080\/00207543.2012.693965","volume":"51","author":"K Yoon","year":"2013","unstructured":"Yoon, K., Ahn, S., Kang, M.: An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems. Int. J. Prod. Res. 51(6), 1680\u20131693 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1147\/rd.165.0462","volume":"16","author":"JC Herz","year":"1972","unstructured":"Herz, J.C.: Recursive computational procedure for two-dimensional stock cutting. IBM J. Res. Dev. 16(5), 462\u2013469 (1972)","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36(4), 297\u2013306 (1985)","journal-title":"J. Oper. Res. Soc."},{"key":"21_CR11","first-page":"66","volume":"43","author":"C Carnieri","year":"1993","unstructured":"Carnieri, C., Mendoza, G.A., Luppold, W.G.: Optimal cutting of dimension parts from lumber with a defect: a heuristic solution procedure. For. Prod. J. 43, 66\u201372 (1993)","journal-title":"For. Prod. J."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1590\/S0101-74382006000200001","volume":"26","author":"ACG Vianna","year":"2006","unstructured":"Vianna, A.C.G., Arenales, M.N.: Problema de corte de placas defeituosas. Pesqui Operacional 26, 185\u2013202 (2006)","journal-title":"Pesqui Operacional"},{"key":"21_CR13","unstructured":"Neidlein, V., Vianna, A.C.G., Arenales, M.N., W\u00e4scher, G.: The two-dimensional guillotine-layout cutting problem with a single defect - an AND\/OR-graph approach. Oper. Res. Proc., 85\u201390 (2008). Fleischmann, B., et al. (ed.). Springer-Verlag, Heidelberg"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/11428831_97","volume":"3514","author":"D Zhang","year":"2005","unstructured":"Zhang, D., Deng, A., Kang, Y.: A hybrid heuristic algorithm for the rectangular packing problem. Lect. Notes Comput. Sci. 3514, 783\u2013791 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"8","key":"21_CR15","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"DF Zhang","year":"2006","unstructured":"Zhang, D.F., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Comput. Oper. Res. 33(8), 2209\u20132217 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"21_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38(5), 423\u2013429 (1987)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1287\/ijoc.1050.0169","volume":"19","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Mart\u00ed, R., Tamarit, J.M., et al.: GRASP and path relinking for the two-dimensional two-stage cutting-stock problem. INFORMS J. Comput. 19(2), 261\u2013272 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s00291-014-0363-x","volume":"36","author":"M Afsharian","year":"2014","unstructured":"Afsharian, M., Niknejad, A., W\u00e4scher, G.: A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects. OR Spectrum 36(4), 971\u2013999 (2014)","journal-title":"OR Spectrum"}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2767-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:06:36Z","timestamp":1579964796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2767-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811527661","9789811527678"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2767-8_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sdcs.sysu.edu.cn\/paap2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}