On Sequencing Retrievals In An Automated Storage/Retrieval System
This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for im...
Gespeichert in:
| Veröffentlicht in: | IIE transactions 1987-03, Vol.19 (1), p.56-66 |
|---|---|
| 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 | 66 |
|---|---|
| container_issue | 1 |
| container_start_page | 56 |
| container_title | IIE transactions |
| container_volume | 19 |
| creator | Han, Min-Hong McGinnis, Leon F. Shieh, Jin Shen White, John A. |
| description | This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A "nearest-neighbor" sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed. |
| doi_str_mv | 10.1080/07408178708975370 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1080_07408178708975370</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1908111</sourcerecordid><originalsourceid>FETCH-LOGICAL-c352t-db183ff9cdcb5cd62d3dd44d9c064aa97fea9fd570bcc3f1a65d2b35e7685aea3</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWKs_wNsiXtdONskmC15K8QsKBavgbcnmo2zZbmqSKv33prT2IjIDc5jnnXd4EbrGcIdBwAg4BYG54CAqzgiHEzTAjLJcCAKnaLDb5wn4OEcXISwBgAMWAzSe9dncfG5Mr9p-kb2a6FvzJbuQvfTZOPUmupWMRmfz6LxcmNERyebbEM3qEp3ZxJurwxyi98eHt8lzPp09vUzG01wRVsRcN1gQayulVcOULgtNtKZUVwpKKmXFrZGV1YxDoxSxWJZMFw1hhpeCSSPJEN3s7669S_-GWC_dxvfJsi5wlSBKaYLwHlLeheCNrde-XUm_rTHUu6DqP0Elze3hsAxKdtbLlEU4CkWRiuCE3e-xtrfOr-S3852uo9x2zv9qyP8uP9pNexY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219685444</pqid></control><display><type>article</type><title>On Sequencing Retrievals In An Automated Storage/Retrieval System</title><source>Taylor & Francis Journals Complete</source><creator>Han, Min-Hong ; McGinnis, Leon F. ; Shieh, Jin Shen ; White, John A.</creator><creatorcontrib>Han, Min-Hong ; McGinnis, Leon F. ; Shieh, Jin Shen ; White, John A.</creatorcontrib><description>This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A "nearest-neighbor" sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed.</description><identifier>ISSN: 0740-817X</identifier><identifier>ISSN: 2472-5854</identifier><identifier>EISSN: 1545-8830</identifier><identifier>EISSN: 2472-5862</identifier><identifier>DOI: 10.1080/07408178708975370</identifier><identifier>CODEN: IIETDM</identifier><language>eng</language><publisher>Norcross, GA: Taylor & Francis Group</publisher><subject>Applied sciences ; Automated storage retrieval systems ; Automation ; Cycles ; Dual ; Exact sciences and technology ; Expected values ; Heuristic ; Material handling, hoisting. Storage. Packaging ; Monte Carlo simulation ; Sequential scheduling ; Statistical analysis ; Storage (container, warehouses, silos, etc.)</subject><ispartof>IIE transactions, 1987-03, Vol.19 (1), p.56-66</ispartof><rights>Copyright Taylor & Francis Group, LLC 1987</rights><rights>1987 INIST-CNRS</rights><rights>Copyright Institute of Industrial Engineers Mar 1987</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c352t-db183ff9cdcb5cd62d3dd44d9c064aa97fea9fd570bcc3f1a65d2b35e7685aea3</citedby><cites>FETCH-LOGICAL-c352t-db183ff9cdcb5cd62d3dd44d9c064aa97fea9fd570bcc3f1a65d2b35e7685aea3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/07408178708975370$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/07408178708975370$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,59646,60435</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8282831$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Han, Min-Hong</creatorcontrib><creatorcontrib>McGinnis, Leon F.</creatorcontrib><creatorcontrib>Shieh, Jin Shen</creatorcontrib><creatorcontrib>White, John A.</creatorcontrib><title>On Sequencing Retrievals In An Automated Storage/Retrieval System</title><title>IIE transactions</title><description>This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A "nearest-neighbor" sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed.</description><subject>Applied sciences</subject><subject>Automated storage retrieval systems</subject><subject>Automation</subject><subject>Cycles</subject><subject>Dual</subject><subject>Exact sciences and technology</subject><subject>Expected values</subject><subject>Heuristic</subject><subject>Material handling, hoisting. Storage. Packaging</subject><subject>Monte Carlo simulation</subject><subject>Sequential scheduling</subject><subject>Statistical analysis</subject><subject>Storage (container, warehouses, silos, etc.)</subject><issn>0740-817X</issn><issn>2472-5854</issn><issn>1545-8830</issn><issn>2472-5862</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LAzEQhoMoWKs_wNsiXtdONskmC15K8QsKBavgbcnmo2zZbmqSKv33prT2IjIDc5jnnXd4EbrGcIdBwAg4BYG54CAqzgiHEzTAjLJcCAKnaLDb5wn4OEcXISwBgAMWAzSe9dncfG5Mr9p-kb2a6FvzJbuQvfTZOPUmupWMRmfz6LxcmNERyebbEM3qEp3ZxJurwxyi98eHt8lzPp09vUzG01wRVsRcN1gQayulVcOULgtNtKZUVwpKKmXFrZGV1YxDoxSxWJZMFw1hhpeCSSPJEN3s7669S_-GWC_dxvfJsi5wlSBKaYLwHlLeheCNrde-XUm_rTHUu6DqP0Elze3hsAxKdtbLlEU4CkWRiuCE3e-xtrfOr-S3852uo9x2zv9qyP8uP9pNexY</recordid><startdate>19870301</startdate><enddate>19870301</enddate><creator>Han, Min-Hong</creator><creator>McGinnis, Leon F.</creator><creator>Shieh, Jin Shen</creator><creator>White, John A.</creator><general>Taylor & Francis Group</general><general>Institute of Industrial Engineers</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope></search><sort><creationdate>19870301</creationdate><title>On Sequencing Retrievals In An Automated Storage/Retrieval System</title><author>Han, Min-Hong ; McGinnis, Leon F. ; Shieh, Jin Shen ; White, John A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c352t-db183ff9cdcb5cd62d3dd44d9c064aa97fea9fd570bcc3f1a65d2b35e7685aea3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>Applied sciences</topic><topic>Automated storage retrieval systems</topic><topic>Automation</topic><topic>Cycles</topic><topic>Dual</topic><topic>Exact sciences and technology</topic><topic>Expected values</topic><topic>Heuristic</topic><topic>Material handling, hoisting. Storage. Packaging</topic><topic>Monte Carlo simulation</topic><topic>Sequential scheduling</topic><topic>Statistical analysis</topic><topic>Storage (container, warehouses, silos, etc.)</topic><toplevel>online_resources</toplevel><creatorcontrib>Han, Min-Hong</creatorcontrib><creatorcontrib>McGinnis, Leon F.</creatorcontrib><creatorcontrib>Shieh, Jin Shen</creatorcontrib><creatorcontrib>White, John A.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><jtitle>IIE transactions</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Han, Min-Hong</au><au>McGinnis, Leon F.</au><au>Shieh, Jin Shen</au><au>White, John A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Sequencing Retrievals In An Automated Storage/Retrieval System</atitle><jtitle>IIE transactions</jtitle><date>1987-03-01</date><risdate>1987</risdate><volume>19</volume><issue>1</issue><spage>56</spage><epage>66</epage><pages>56-66</pages><issn>0740-817X</issn><issn>2472-5854</issn><eissn>1545-8830</eissn><eissn>2472-5862</eissn><coden>IIETDM</coden><abstract>This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A "nearest-neighbor" sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed.</abstract><cop>Norcross, GA</cop><pub>Taylor & Francis Group</pub><doi>10.1080/07408178708975370</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0740-817X |
| ispartof | IIE transactions, 1987-03, Vol.19 (1), p.56-66 |
| issn | 0740-817X 2472-5854 1545-8830 2472-5862 |
| language | eng |
| recordid | cdi_crossref_primary_10_1080_07408178708975370 |
| source | Taylor & Francis Journals Complete |
| subjects | Applied sciences Automated storage retrieval systems Automation Cycles Dual Exact sciences and technology Expected values Heuristic Material handling, hoisting. Storage. Packaging Monte Carlo simulation Sequential scheduling Statistical analysis Storage (container, warehouses, silos, etc.) |
| title | On Sequencing Retrievals In An Automated Storage/Retrieval System |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T15%3A09%3A36IST&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=On%20Sequencing%20Retrievals%20In%20An%20Automated%20Storage/Retrieval%20System&rft.jtitle=IIE%20transactions&rft.au=Han,%20Min-Hong&rft.date=1987-03-01&rft.volume=19&rft.issue=1&rft.spage=56&rft.epage=66&rft.pages=56-66&rft.issn=0740-817X&rft.eissn=1545-8830&rft.coden=IIETDM&rft_id=info:doi/10.1080/07408178708975370&rft_dat=%3Cproquest_cross%3E1908111%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=219685444&rft_id=info:pmid/&rfr_iscdi=true |