{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:49:44Z","timestamp":1767772184805,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:00Z","timestamp":1586217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:00Z","timestamp":1586217600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71801046"],"award-info":[{"award-number":["71801046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51734004"],"award-info":[{"award-number":["51734004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10479-020-03604-w","type":"journal-article","created":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T10:02:31Z","timestamp":1586253751000},"page":"291-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem"],"prefix":"10.1007","volume":"289","author":[{"given":"Jianyu","family":"Long","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4950-6515","authenticated-orcid":false,"given":"Zhong","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Xiaoqiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Wanzhe","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,7]]},"reference":[{"key":"3604_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-018-3117-3","volume":"286","author":"N Al-Hinai","year":"2020","unstructured":"Al-Hinai, N., & Triki, C. (2020). A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice. Annals of Operations Research,286, 325\u2013350.","journal-title":"Annals of Operations Research"},{"key":"3604_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research,171, 85\u2013106.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F., & Pedroso, J. P. (2016). Bin packing and related problems: General arc-flow formulation with graph compression. Computers & Operations Research,69, 56\u201367.","journal-title":"Computers & Operations Research"},{"key":"3604_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1111\/itor.12390","volume":"26","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Song, X., Ouelhadj, D., & Cui, Y. D. (2019). A heuristic for the skiving and cutting stock problem in paper and plastic film industries. International Transactions in Operational Research,26, 157\u2013179.","journal-title":"International Transactions in Operational Research"},{"key":"3604_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"FRK Chung","year":"1982","unstructured":"Chung, F. R. K., Garey, M. R., & Johnson, D. S. (1982). On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods,3, 66\u201376.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"3604_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"GF Cintra","year":"2008","unstructured":"Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research,191, 61\u201385.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10898-012-9930-3","volume":"55","author":"Y Cui","year":"2013","unstructured":"Cui, Y. (2013). A new dynamic programming procedure for three-staged cutting patterns. Journal of Global Optimization,55, 349\u2013357.","journal-title":"Journal of Global Optimization"},{"key":"3604_CR8","doi-asserted-by":"publisher","first-page":"7398","DOI":"10.1080\/00207543.2017.1349951","volume":"55","author":"B Durak","year":"2017","unstructured":"Durak, B., & Aksu, D. T. (2017). Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets. International Journal of Production Research,55, 7398\u20137411.","journal-title":"International Journal of Production Research"},{"key":"3604_CR9","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","volume":"29","author":"H Dyckhoff","year":"1981","unstructured":"Dyckhoff, H. (1981). A new linear-programming approach to the cutting stock problem. Operations Research,29, 1092\u20131104.","journal-title":"Operations Research"},{"key":"3604_CR10","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2013.02.026","volume":"40","author":"F Furini","year":"2013","unstructured":"Furini, F., & Malaguti, E. (2013). Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Computers & Operations Research,40, 1953\u20131962.","journal-title":"Computers & Operations Research"},{"key":"3604_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ejor.2011.10.018","volume":"218","author":"F Furini","year":"2012","unstructured":"Furini, F., Malaguti, E., Duran, R. M., Persiani, A., & Toth, P. (2012). A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. European Journal of Operational Research,218, 251\u2013260.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore, P. C., & Gomory, R. E. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research,13, 94\u2013120.","journal-title":"Operations Research"},{"key":"3604_CR13","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"JF Goncalves","year":"2007","unstructured":"Goncalves, J. F. (2007). A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. European Journal of Operational Research,183, 1212\u20131229.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"RW Haessler","year":"1991","unstructured":"Haessler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research,54, 141\u2013150.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s12351-015-0221-x","volume":"17","author":"L Liu","year":"2017","unstructured":"Liu, L., Liu, X., Pei, J., Fan, W., & Pardalos, P. M. (2017). A study on decision making of cutting stock with frustum of cone bars. Operational Research,17, 187\u2013204.","journal-title":"Operational Research"},{"key":"3604_CR16","doi-asserted-by":"publisher","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, 241\u2013252.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization,8, 363\u2013379.","journal-title":"Journal of Combinatorial Optimization"},{"key":"3604_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A Lodi","year":"2003","unstructured":"Lodi, A., & Monaci, M. (2003). Integer linear programming models for 2-staged two-dimensional knapsack problems. Mathematical Programming,94, 257\u2013278.","journal-title":"Mathematical Programming"},{"key":"3604_CR19","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.cor.2009.08.005","volume":"37","author":"R Macedo","year":"2010","unstructured":"Macedo, R., Aives, C., & Valerio de Carvalho, J. M. (2010). Arc-flow model for the two-dimensional guillotine cutting stock problem. Computers & Operations Research,37, 991\u20131001.","journal-title":"Computers & Operations Research"},{"key":"3604_CR20","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1057\/jors.2012.70","volume":"64","author":"M Mrad","year":"2013","unstructured":"Mrad, M., Meftahi, I., & Haouari, M. (2013). A branch-and-price algorithm for the two-stage guillotine cutting stock problem. Journal of the Operational Research Society,64, 629\u2013637.","journal-title":"Journal of the Operational Research Society"},{"key":"3604_CR21","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1057\/s41274-017-0221-8","volume":"69","author":"V Nesello","year":"2018","unstructured":"Nesello, V., Delorme, M., Iori, M., & Subramanian, A. (2018). Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production. Journal of the Operational Research Society,69, 326\u2013339.","journal-title":"Journal of the Operational Research Society"},{"key":"3604_CR22","doi-asserted-by":"publisher","first-page":"6002","DOI":"10.1080\/00207543.2013.791754","volume":"51","author":"MK Omar","year":"2013","unstructured":"Omar, M. K., & Ramakrishnan, K. (2013). Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation. International Journal of Production Research,51, 6002\u20136016.","journal-title":"International Journal of Production Research"},{"key":"3604_CR23","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1080\/00207543.2017.1355577","volume":"56","author":"C Paquay","year":"2018","unstructured":"Paquay, C., Limbourg, S., Schyns, M., & Oliveira, J. F. (2018). MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints. International Journal of Production Research,56, 1581\u20131592.","journal-title":"International Journal of Production Research"},{"key":"3604_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna, P. H. V., Subramanian, A., Ochi, L. S., Vidal, T., & Prins, C. (2019). A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research,273, 5\u201374.","journal-title":"Annals of Operations Research"},{"key":"3604_CR25","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J Puchinger","year":"2007","unstructured":"Puchinger, J., & Raidl, G. R. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research,183, 1304\u20131327.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR26","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2010.01.039","volume":"205","author":"E Silva","year":"2010","unstructured":"Silva, E., Alvelos, F., & Valerio de Carvalho, J. M. (2010). An integer programming model for two- and three-stage two-dimensional cutting stock problems. European Journal of Operational Research,205, 699\u2013708.","journal-title":"European Journal of Operational Research"},{"key":"3604_CR27","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JM Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho, J. M. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research,86, 629\u2013659.","journal-title":"Annals of Operations Research"},{"key":"3604_CR28","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1287\/mnsc.47.6.864.9809","volume":"47","author":"F Vanderbeck","year":"2001","unstructured":"Vanderbeck, F. (2001). A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem. Management Science,47, 864\u2013879.","journal-title":"Management Science"},{"key":"3604_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G., & Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: A computational study. OR Spektrum,18, 131\u2013144.","journal-title":"OR Spektrum"},{"key":"3604_CR30","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. (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":"3604_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/itor.12138","volume":"23","author":"LJ Wei","year":"2016","unstructured":"Wei, L. J., Qin, H., Cheang, B., & Xu, X. H. (2016). An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. International Transactions in Operational Research,23, 65\u201392.","journal-title":"International Transactions in Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03604-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-020-03604-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03604-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T23:20:40Z","timestamp":1617751240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-020-03604-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,7]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["3604"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03604-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2020,4,7]]},"assertion":[{"value":"7 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}