{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T06:08:36Z","timestamp":1775887716339,"version":"3.50.1"},"reference-count":50,"publisher":"Informa UK Limited","issue":"9","funder":[{"DOI":"10.13039\/501100001807","name":"S\u00e3o Paulo Research Foundation","doi-asserted-by":"publisher","award":["2020\/00747-2, 2016\/01860-1, 2013\/07375-0"],"award-info":[{"award-number":["2020\/00747-2, 2016\/01860-1, 2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["304144\/2019-3"],"award-info":[{"award-number":["304144\/2019-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2023,5,3]]},"DOI":"10.1080\/00207543.2022.2070882","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T10:05:37Z","timestamp":1652349937000},"page":"2895-2916","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":9,"title":["Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks"],"prefix":"10.1080","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6722-7571","authenticated-orcid":false,"given":"Mateus","family":"Martin","sequence":"first","affiliation":[{"name":"Universidade Federal Fluminense","place":["Petr\u00f3polis, Brazil"]},{"name":"Universidade Federal de S\u00e3o Paulo","place":["S\u00e3o Jos\u00e9 dos Campos, Brazil"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6946-9670","authenticated-orcid":false,"given":"Horacio","family":"Hideki Yanasse","sequence":"additional","affiliation":[{"name":"Universidade Federal de S\u00e3o Paulo","place":["S\u00e3o Jos\u00e9 dos Campos, Brazil"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0822-3439","authenticated-orcid":false,"given":"Maristela O.","family":"Santos","sequence":"additional","affiliation":[{"name":"Universidade de S\u00e3o Paulo","place":["S\u00e3o Carlos, Brazil"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3948-305X","authenticated-orcid":false,"given":"Reinaldo","family":"Morabito","sequence":"additional","affiliation":[{"name":"Universidade Federal de S\u00e3o Carlos","place":["S\u00e3o Carlos, Brazil"]}]}],"member":"301","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"key":"e_1_3_5_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12134"},{"key":"e_1_3_5_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00128-5"},{"key":"e_1_3_5_4_1","unstructured":"Baptiste P. 2005. \u201cSimple MIP Formulations to Minimize the Maximum Number of Open Stacks.\u201d In Constraint Modelling Challenge 2005 edited by B. M. Smith and I. P. Gent. Edinburgh. https:\/\/ipg.host.cs.st-andrews.ac.uk\/challenge\/."},{"key":"e_1_3_5_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2582416"},{"key":"e_1_3_5_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00189-8"},{"key":"e_1_3_5_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.038"},{"key":"e_1_3_5_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2582731"},{"key":"e_1_3_5_9_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2014.60"},{"key":"e_1_3_5_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209062"},{"key":"e_1_3_5_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1349951"},{"key":"e_1_3_5_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.6.1092"},{"key":"e_1_3_5_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90350-K"},{"key":"e_1_3_5_14_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1974.5"},{"key":"e_1_3_5_15_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0203076"},{"key":"e_1_3_5_16_1","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman & Co."},{"key":"e_1_3_5_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.1.94"},{"key":"e_1_3_5_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12109"},{"key":"e_1_3_5_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1720923"},{"key":"e_1_3_5_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540310001622421"},{"key":"e_1_3_5_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00054-5"},{"key":"e_1_3_5_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"e_1_3_5_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038915.62826.79"},{"key":"e_1_3_5_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0319-9"},{"key":"e_1_3_5_25_1","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2015.035.02.0213"},{"key":"e_1_3_5_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-014-9264-8"},{"key":"e_1_3_5_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.08.005"},{"key":"e_1_3_5_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588227"},{"key":"e_1_3_5_29_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1988.42"},{"key":"e_1_3_5_30_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1630773"},{"key":"e_1_3_5_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.1876270"},{"key":"e_1_3_5_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13053"},{"key":"e_1_3_5_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-010-0164-2"},{"key":"e_1_3_5_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/002075400411457"},{"key":"e_1_3_5_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.066"},{"key":"e_1_3_5_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102432"},{"key":"e_1_3_5_37_1","doi-asserted-by":"publisher","DOI":"10.1590\/s0101-74382005000300007"},{"key":"e_1_3_5_38_1","doi-asserted-by":"publisher","DOI":"10.1590\/s0101-74382007000300008"},{"key":"e_1_3_5_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.064"},{"key":"e_1_3_5_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.050"},{"key":"e_1_3_5_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64143-0"},{"key":"e_1_3_5_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.01.039"},{"key":"e_1_3_5_43_1","unstructured":"Smith B. M. and I. P. Gent. 2005. \u201cConstraint Modelling Challenge 2005.\u201d In The Fifth Workshop on Modelling and Solving Problems with Constraints IJCAI 05. Edinburgh. https:\/\/ipg.host.cs.st-andrews.ac.uk\/challenge\/"},{"key":"e_1_3_5_44_1","doi-asserted-by":"publisher","DOI":"10.1023\/a:1018952112615"},{"key":"e_1_3_5_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"e_1_3_5_46_1","first-page":"57","article-title":"A Transformation for Solving a Pattern Sequencing Problem in the Wood Cut Industry","volume":"17","author":"Yanasse H. H.","year":"1997","unstructured":"Yanasse, H. H. 1997a. \u201cA Transformation for Solving a Pattern Sequencing Problem in the Wood Cut Industry.\u201d Pesquisa Operacional 17: 57\u201370.","journal-title":"Pesquisa Operacional"},{"key":"e_1_3_5_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)84107-0"},{"key":"e_1_3_5_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.054"},{"key":"e_1_3_5_49_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540500478603"},{"key":"e_1_3_5_50_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540601011543"},{"key":"e_1_3_5_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90222-H"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2022.2070882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T17:40:06Z","timestamp":1769708406000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2022.2070882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,12]]},"references-count":50,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,5,3]]}},"alternative-id":["10.1080\/00207543.2022.2070882"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2022.2070882","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,12]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-11-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}