{"id":"https://openalex.org/W4200132865","doi":"https://doi.org/10.1109/clei53233.2021.9640112","title":"The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints","display_name":"The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints","publication_year":2021,"publication_date":"2021-10-25","ids":{"openalex":"https://openalex.org/W4200132865","doi":"https://doi.org/10.1109/clei53233.2021.9640112"},"language":"en","primary_location":{"id":"doi:10.1109/clei53233.2021.9640112","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei53233.2021.9640112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 XLVII Latin American Computing Conference (CLEI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043528531","display_name":"Eduardo Theodoro Bogue","orcid":null},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Eduardo T. Bogue","raw_affiliation_strings":["Universidade Federal de Mato Grosso do Sul,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Ponta Porã,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Mato Grosso do Sul,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Ponta Porã,Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009906239","display_name":"Marcos Vin\u00edcius Almeida Guimar\u00e3es","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos V. A. Guimar\u00e3es","raw_affiliation_strings":["Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070339603","display_name":"Thiago F. Noronha","orcid":"https://orcid.org/0000-0002-6831-2006"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Thiago F. Noronha","raw_affiliation_strings":["Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051413102","display_name":"Armando Hon\u00f3rio Pereira","orcid":"https://orcid.org/0000-0003-2837-0284"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Armando H. Pereira","raw_affiliation_strings":["Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Belo Horizonte,Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063834733","display_name":"Iago A. Carvalho","orcid":"https://orcid.org/0000-0001-9404-1329"},"institutions":[{"id":"https://openalex.org/I23925101","display_name":"Universidade Federal de Alfenas","ror":"https://ror.org/034vpja60","country_code":"BR","type":"education","lineage":["https://openalex.org/I23925101"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Iago A. Carvalho","raw_affiliation_strings":["Universidade Federal de Alfenas,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Alfenas,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Alfenas,Dep. de Ci\u00eancia da Computa\u00e7\u00e3o,Alfenas,Brazil","institution_ids":["https://openalex.org/I23925101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032052316","display_name":"Sebasti\u00e1n Urrutia","orcid":"https://orcid.org/0000-0002-7561-6825"},"institutions":[{"id":"https://openalex.org/I182204967","display_name":"Molde University College","ror":"https://ror.org/00kxjcd28","country_code":"NO","type":"education","lineage":["https://openalex.org/I182204967"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Sebasti\u00e1n Urrutia","raw_affiliation_strings":["Molde University College,Faculty of Logistics,Molde,Norway","Faculty of Logistics, Molde University College, Molde, Norway"],"affiliations":[{"raw_affiliation_string":"Molde University College,Faculty of Logistics,Molde,Norway","institution_ids":["https://openalex.org/I182204967"]},{"raw_affiliation_string":"Faculty of Logistics, Molde University College, Molde, Norway","institution_ids":["https://openalex.org/I182204967"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5043528531"],"corresponding_institution_ids":["https://openalex.org/I122558511"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24081043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14180","display_name":"Law, logistics, and international trade","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1402","display_name":"Accounting"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7324072122573853},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7091743350028992},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7058587074279785},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6948220133781433},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6408876180648804},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.613632321357727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.595471203327179},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5843230485916138},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.5617304444313049},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.543912947177887},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5041168928146362},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.473122775554657},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.435702919960022},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4265856444835663},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41337817907333374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3269634246826172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29381710290908813},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23657840490341187},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.125459223985672},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.09843257069587708}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7324072122573853},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7091743350028992},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7058587074279785},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6948220133781433},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6408876180648804},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.613632321357727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.595471203327179},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5843230485916138},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.5617304444313049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.543912947177887},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5041168928146362},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.473122775554657},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.435702919960022},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4265856444835663},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41337817907333374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3269634246826172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29381710290908813},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23657840490341187},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.125459223985672},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.09843257069587708},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clei53233.2021.9640112","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei53233.2021.9640112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 XLVII Latin American Computing Conference (CLEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2159351466","https://openalex.org/W1483913682","https://openalex.org/W2354313438","https://openalex.org/W2020081923","https://openalex.org/W4249611560","https://openalex.org/W4389887952","https://openalex.org/W1966986652","https://openalex.org/W2367132302","https://openalex.org/W1563501581","https://openalex.org/W2142105839"],"abstract_inverted_index":{"This":[0,112],"paper":[1],"tackles":[2],"the":[3,16,24,54,59,74,78,125,134,138,146,149,153,161,164,174,177,199,217],"2-Dimensional":[4],"Guillotine":[5],"Cutting":[6],"Stock":[7],"Problem":[8,202],"with":[9,23,203,224],"Stack":[10],"Constraints.":[11,205],"The":[12,30],"problem":[13],"asks":[14],"for":[15,176,198],"cutting":[17,31],"of":[18,21,27,38,140,155,212],"a":[19,36,41,69,92,182,190],"set":[20],"items":[22,60,79,108,118,143,158],"minimum":[25],"amount":[26],"raw":[28],"material.":[29],"patterns":[32],"are":[33,61],"subject":[34],"to":[35,181],"number":[37],"constraints,":[39],"including":[40],"new":[42],"realistic":[43,213],"constraint,":[44],"regarding":[45],"item":[46,86,89],"precedence,":[47],"which":[48,77],"has":[49],"just":[50],"been":[51],"introduced":[52],"in":[53,63,76,109,124,148,163,179,228],"literature.":[55],"In":[56],"this":[57],"case,":[58],"organized":[62],"stacks,":[64],"where":[65,117],"each":[66],"stack":[67],"represents":[68],"customer":[70],"request":[71],"and":[72,122],"defines":[73],"order":[75,127],"must":[80,96,119],"be":[81,97,120,131],"cut.":[82],"That":[83],"is,":[84],"if":[85],"i":[87,95],"precedes":[88],"j":[90],"within":[91],"stack,":[93],"then":[94],"cut":[98],"before":[99],"j.":[100],"However,":[101],"there":[102],"is":[103,145,160],"no":[104],"precedence":[105],"constraint":[106,113],"between":[107],"different":[110],"stacks.":[111],"comes":[114],"from":[115,173],"applications":[116],"stacked":[121],"shipped":[123],"exact":[126,193],"that":[128,187,216],"they":[129],"will":[130],"used":[132],"by":[133],"customer,":[135],"thus":[136],"avoiding":[137],"risk":[139],"damaging":[141],"fragile":[142],"(as":[144,159],"case":[147,162],"glass":[150],"industry)":[151],"or":[152],"cost":[154],"moving":[156],"heavy":[157],"steel":[165],"industry).":[166],"We":[167],"propose":[168],"two":[169],"constructive":[170],"heuristics":[171],"extended":[172],"literature":[175],"problem,":[178],"addition":[180],"dynamic":[183,218],"programming":[184,219],"based":[185,220],"heuristic":[186,221],"uses":[188],"as":[189],"subroutine":[191],"an":[192],"pseudo-polynomial":[194],"time":[195],"algorithm":[196],"developed":[197],"Rectangular":[200],"Knapsack":[201],"Batch":[204],"Computational":[206],"experiments,":[207],"performed":[208],"on":[209],"three":[210],"sets":[211],"instances,":[214],"showed":[215],"found":[222],"solutions":[223],"smaller":[225],"optimally":[226],"gaps":[227],"all":[229],"instances":[230],"evaluated.":[231]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}