Efficient Algorithms for Load Shuffling in Split-Platform AS/RS
We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. 1D, 2D and 3D AS/RS racks have been designed in order to achieve the shuffli...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en_US |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/3856 |
| _version_ | 1826206151111344128 |
|---|---|
| author | Hu, Yahong Hsu, Wen Jing Xu, Xiang |
| author_facet | Hu, Yahong Hsu, Wen Jing Xu, Xiang |
| author_sort | Hu, Yahong |
| collection | MIT |
| description | We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. 1D, 2D and 3D AS/RS racks have been designed in order to achieve the shuffling efficiently. The shuffling algorithms are described in detail. The response time of retrieval, the lower and upper bounds of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient. |
| first_indexed | 2024-09-23T13:24:54Z |
| format | Article |
| id | mit-1721.1/3856 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:24:54Z |
| publishDate | 2003 |
| record_format | dspace |
| spelling | mit-1721.1/38562019-04-10T19:06:24Z Efficient Algorithms for Load Shuffling in Split-Platform AS/RS Hu, Yahong Hsu, Wen Jing Xu, Xiang algorithm AS/RS sorting We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. 1D, 2D and 3D AS/RS racks have been designed in order to achieve the shuffling efficiently. The shuffling algorithms are described in detail. The response time of retrieval, the lower and upper bounds of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient. Singapore-MIT Alliance (SMA) 2003-12-13T19:06:53Z 2003-12-13T19:06:53Z 2004-01 Article http://hdl.handle.net/1721.1/3856 en_US Computer Science (CS); 643176 bytes application/pdf application/pdf |
| spellingShingle | algorithm AS/RS sorting Hu, Yahong Hsu, Wen Jing Xu, Xiang Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title | Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title_full | Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title_fullStr | Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title_full_unstemmed | Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title_short | Efficient Algorithms for Load Shuffling in Split-Platform AS/RS |
| title_sort | efficient algorithms for load shuffling in split platform as rs |
| topic | algorithm AS/RS sorting |
| url | http://hdl.handle.net/1721.1/3856 |
| work_keys_str_mv | AT huyahong efficientalgorithmsforloadshufflinginsplitplatformasrs AT hsuwenjing efficientalgorithmsforloadshufflinginsplitplatformasrs AT xuxiang efficientalgorithmsforloadshufflinginsplitplatformasrs |