A search strategy for the one-size assortment problem

The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values wit...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1994-04, Vol.74 (1), p.135-142
Main Author: Yanasse, Horacio Hideki
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Assortment problem
Cutting stock problem
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Strategy
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73
cites cdi_FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73
container_end_page 142
container_issue 1
container_start_page 135
container_title European journal of operational research
container_volume 74
creator Yanasse, Horacio Hideki
description The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.
doi_str_mv 10.1016/0377-2217(94)90211-9
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204132639</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0377221794902119</els_id><sourcerecordid>874853</sourcerecordid><originalsourceid>FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73</originalsourceid><addsrcrecordid>eNp9kE1PwzAMhiMEEmPwDzhUiAMcCnGSNs0FaZr41CQucI6y1GWd1nYk2aTx60nptCORHPvw-LX9EnIJ9A4o5PeUS5kyBvJGiVtFGUCqjsgICsnSvMjpMRkdkFNy5v2SUgoZZCOSTRKPxtlF4oMzAb92SdW5JCww6VpMff2DifG-c6HBNiRr181X2JyTk8qsPF7s85h8Pj1-TF_S2fvz63QyS61gMqSFYShKyrjFeW7zuZJzqMAYBZWQBgVaIQyPqCkqi4UBWQBmJVMUJcdS8jG5GnTj3O8N-qCX3ca1caRmVABnOVcREgNkXee9w0qvXd0Yt9NAde-P7o_X_fFaCf3nj-7b3oY2h2u0hx6Mb9k59HqruZEifrsYoFRf1n0ZY91nnmkQTC9CE8Wu94sab82qcqa1tT-ICigKkdOIPQwYRtO2NTrtbY2txbJ2aIMuu_r_pX8BKEGRWA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204132639</pqid></control><display><type>article</type><title>A search strategy for the one-size assortment problem</title><source>Backfile Package - Decision Sciences [YDT]</source><creator>Yanasse, Horacio Hideki</creator><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><description>The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/0377-2217(94)90211-9</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Assortment problem ; Cutting stock problem ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristic ; Heuristics ; Mathematical models ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Strategy ; Studies</subject><ispartof>European journal of operational research, 1994-04, Vol.74 (1), p.135-142</ispartof><rights>1994</rights><rights>1994 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Apr 7, 1994</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73</citedby><cites>FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/0377221794902119$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3440,27924,27925,45991</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=4188460$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a74_3ay_3a1994_3ai_3a1_3ap_3a135-142.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><title>A search strategy for the one-size assortment problem</title><title>European journal of operational research</title><description>The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Assortment problem</subject><subject>Cutting stock problem</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Mathematical models</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Strategy</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNp9kE1PwzAMhiMEEmPwDzhUiAMcCnGSNs0FaZr41CQucI6y1GWd1nYk2aTx60nptCORHPvw-LX9EnIJ9A4o5PeUS5kyBvJGiVtFGUCqjsgICsnSvMjpMRkdkFNy5v2SUgoZZCOSTRKPxtlF4oMzAb92SdW5JCww6VpMff2DifG-c6HBNiRr181X2JyTk8qsPF7s85h8Pj1-TF_S2fvz63QyS61gMqSFYShKyrjFeW7zuZJzqMAYBZWQBgVaIQyPqCkqi4UBWQBmJVMUJcdS8jG5GnTj3O8N-qCX3ca1caRmVABnOVcREgNkXee9w0qvXd0Yt9NAde-P7o_X_fFaCf3nj-7b3oY2h2u0hx6Mb9k59HqruZEifrsYoFRf1n0ZY91nnmkQTC9CE8Wu94sab82qcqa1tT-ICigKkdOIPQwYRtO2NTrtbY2txbJ2aIMuu_r_pX8BKEGRWA</recordid><startdate>19940407</startdate><enddate>19940407</enddate><creator>Yanasse, Horacio Hideki</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19940407</creationdate><title>A search strategy for the one-size assortment problem</title><author>Yanasse, Horacio Hideki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Assortment problem</topic><topic>Cutting stock problem</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Mathematical models</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Strategy</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yanasse, Horacio Hideki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A search strategy for the one-size assortment problem</atitle><jtitle>European journal of operational research</jtitle><date>1994-04-07</date><risdate>1994</risdate><volume>74</volume><issue>1</issue><spage>135</spage><epage>142</epage><pages>135-142</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0377-2217(94)90211-9</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 1994-04, Vol.74 (1), p.135-142
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204132639
source Backfile Package - Decision Sciences [YDT]
subjects Algorithms
Applied sciences
Assortment problem
Cutting stock problem
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Strategy
Studies
title A search strategy for the one-size assortment problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T07%3A23%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=A%20search%20strategy%20for%20the%20one-size%20assortment%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Yanasse,%20Horacio%20Hideki&rft.date=1994-04-07&rft.volume=74&rft.issue=1&rft.spage=135&rft.epage=142&rft.pages=135-142&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/0377-2217(94)90211-9&rft_dat=%3Cproquest_cross%3E874853%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c427t-8a2e4d023ceb6c6b97b1f1aa91f47ae4ec44a3427a8fce8a1781e5d290e73ed73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204132639&rft_id=info:pmid/&rfr_iscdi=true