Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Singapore-MIT Alliance (SMA)
  3. Computer Science (CS)
  4. Efficient Algorithms for Load Shuffling in Split-Platform AS/RS

Efficient Algorithms for Load Shuffling in Split-Platform AS/RS

Thumbnail Image
Download
Name

CS008.pdf

Size

628.1 KB

Format

Adobe PDF

Checksum (MD5)

d15a3fa1995d9cec74ea72d67e6a2240

Author(s)
Hu, Yahong
•
Hsu, Wen Jing
•
Xu, Xiang
Date Issued
January 2004
Series/Report no.
Computer Science (CS);
Abstract
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.
Subjects
algorithm
AS/RS
sorting
Persistent DSpace Link
http://hdl.handle.net/1721.1/3856
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.