An enumeration scheme to generate constrained exact checkerboard patterns
Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to gen...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2008-06, Vol.35 (6), p.2114-2128 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2128 |
|---|---|
| container_issue | 6 |
| container_start_page | 2114 |
| container_title | Computers & operations research |
| container_volume | 35 |
| creator | Yanasse, Horacio Hideki Katsurayama, Daniel Massaru |
| description | Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times. |
| doi_str_mv | 10.1016/j.cor.2006.10.018 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_30962957</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054806002759</els_id><sourcerecordid>1378673201</sourcerecordid><originalsourceid>FETCH-LOGICAL-c416t-e94012aa45a975bff5f03bab1be1dc545a5affc4c5d2e52575f18b498f90f103</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_wNsi6G3rZHezH3gqxY9CwUsP3kI2O9Gs26QmWdF_b0qLBw_OJczLMzPhIeSSwowCLW_7mbRulgGUsZ8BrY_IhNZVnlYlezkmE8iBpcCK-pSced9DrCqjE7KcmwTNuEEngrYm8fINN5gEm7yi2YWYSGt8cEIb7BL8EjIkkZHv6ForXJdsRQjojD8nJ0oMHi8O75SsH-7Xi6d09fy4XMxXqSxoGVJsCqCZEAUTTcVapZiCvBUtbZF2ksWYCaVkIVmXIctYxRSt26KpVQOKQj4lN_u1W2c_RvSBb7SXOAzCoB09z6Eps4ZVEbz6A_Z2dCZ-jdOG1XlksgjRPSSd9d6h4lunN8J9cwp8J5b3PIrlO7G7KIqNM9eHxcJLMSgnjNT-dzCiUJbQRO5uz2G08anRcS81GomddigD76z-58oP_POOIg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195839572</pqid></control><display><type>article</type><title>An enumeration scheme to generate constrained exact checkerboard patterns</title><source>Elsevier ScienceDirect Journals</source><creator>Yanasse, Horacio Hideki ; Katsurayama, Daniel Massaru</creator><creatorcontrib>Yanasse, Horacio Hideki ; Katsurayama, Daniel Massaru</creatorcontrib><description>Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2006.10.018</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>1-group pattern ; 2-stage guillotine patterns ; Applied sciences ; Branch & bound algorithms ; Constructive algorithm ; Enumerative algorithm ; Exact restricted checkerboard pattern ; Exact sciences and technology ; Operational research. Management science ; Optimization algorithms ; Pattern generation ; Studies</subject><ispartof>Computers & operations research, 2008-06, Vol.35 (6), p.2114-2128</ispartof><rights>2006</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Jun 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c416t-e94012aa45a975bff5f03bab1be1dc545a5affc4c5d2e52575f18b498f90f103</citedby><cites>FETCH-LOGICAL-c416t-e94012aa45a975bff5f03bab1be1dc545a5affc4c5d2e52575f18b498f90f103</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0305054806002759$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20006609$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Katsurayama, Daniel Massaru</creatorcontrib><title>An enumeration scheme to generate constrained exact checkerboard patterns</title><title>Computers & operations research</title><description>Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times.</description><subject>1-group pattern</subject><subject>2-stage guillotine patterns</subject><subject>Applied sciences</subject><subject>Branch & bound algorithms</subject><subject>Constructive algorithm</subject><subject>Enumerative algorithm</subject><subject>Exact restricted checkerboard pattern</subject><subject>Exact sciences and technology</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>Pattern generation</subject><subject>Studies</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_wNsi6G3rZHezH3gqxY9CwUsP3kI2O9Gs26QmWdF_b0qLBw_OJczLMzPhIeSSwowCLW_7mbRulgGUsZ8BrY_IhNZVnlYlezkmE8iBpcCK-pSced9DrCqjE7KcmwTNuEEngrYm8fINN5gEm7yi2YWYSGt8cEIb7BL8EjIkkZHv6ForXJdsRQjojD8nJ0oMHi8O75SsH-7Xi6d09fy4XMxXqSxoGVJsCqCZEAUTTcVapZiCvBUtbZF2ksWYCaVkIVmXIctYxRSt26KpVQOKQj4lN_u1W2c_RvSBb7SXOAzCoB09z6Eps4ZVEbz6A_Z2dCZ-jdOG1XlksgjRPSSd9d6h4lunN8J9cwp8J5b3PIrlO7G7KIqNM9eHxcJLMSgnjNT-dzCiUJbQRO5uz2G08anRcS81GomddigD76z-58oP_POOIg</recordid><startdate>20080601</startdate><enddate>20080601</enddate><creator>Yanasse, Horacio Hideki</creator><creator>Katsurayama, Daniel Massaru</creator><general>Elsevier Ltd</general><general>Elsevier Science</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080601</creationdate><title>An enumeration scheme to generate constrained exact checkerboard patterns</title><author>Yanasse, Horacio Hideki ; Katsurayama, Daniel Massaru</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c416t-e94012aa45a975bff5f03bab1be1dc545a5affc4c5d2e52575f18b498f90f103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>1-group pattern</topic><topic>2-stage guillotine patterns</topic><topic>Applied sciences</topic><topic>Branch & bound algorithms</topic><topic>Constructive algorithm</topic><topic>Enumerative algorithm</topic><topic>Exact restricted checkerboard pattern</topic><topic>Exact sciences and technology</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>Pattern generation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Katsurayama, Daniel Massaru</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yanasse, Horacio Hideki</au><au>Katsurayama, Daniel Massaru</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An enumeration scheme to generate constrained exact checkerboard patterns</atitle><jtitle>Computers & operations research</jtitle><date>2008-06-01</date><risdate>2008</risdate><volume>35</volume><issue>6</issue><spage>2114</spage><epage>2128</epage><pages>2114-2128</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2006.10.018</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2008-06, Vol.35 (6), p.2114-2128 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_30962957 |
| source | Elsevier ScienceDirect Journals |
| subjects | 1-group pattern 2-stage guillotine patterns Applied sciences Branch & bound algorithms Constructive algorithm Enumerative algorithm Exact restricted checkerboard pattern Exact sciences and technology Operational research. Management science Optimization algorithms Pattern generation Studies |
| title | An enumeration scheme to generate constrained exact checkerboard patterns |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T14%3A50%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20enumeration%20scheme%20to%20generate%20constrained%20exact%20checkerboard%20patterns&rft.jtitle=Computers%20&%20operations%20research&rft.au=Yanasse,%20Horacio%20Hideki&rft.date=2008-06-01&rft.volume=35&rft.issue=6&rft.spage=2114&rft.epage=2128&rft.pages=2114-2128&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2006.10.018&rft_dat=%3Cproquest_cross%3E1378673201%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195839572&rft_id=info:pmid/&rft_els_id=S0305054806002759&rfr_iscdi=true |