文献类型：期刊文献

中文题名：The Complexity and On-Line Algorithm for Automated Storage and Retrieval System with Stacker Cranes on One Rail

英文题名：The Complexity and On-Line Algorithm for Automated Storage and Retrieval System with Stacker Cranes on One Rail

作者：Gao Qiang[1];Lu Xiwen[1]

机构：[1]East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2016

卷号：29

期号：5

起止页码：1302

中文期刊名：Journal of Systems Science & Complexity

外文期刊名：JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY

收录：;EI(收录号：20160401852194);Scopus;WOS:【SCI-EXPANDED(收录号:WOS:000384986000009)】；CSCD:【CSCD2015_2016】；PubMed;

基金：This research was supported by the National Natural Science Foundation of China under Grant No. 11371137 and Research Fund for the Doctoral Program of China under Grant No. 20120074110021.

语种：英文

中文关键词：Automated storage and retrieval system;NPohard;on-line algorithm;routing;scheduling.

外文关键词：Automated storage and retrieval system; NP-hard; on-line algorithm; routing; scheduling

摘要：This paper considers an on-line scheduling and routing problem concerning the automated storage and retrieval system from tobacco industry. In this problem, stacker cranes run on one common rail between two racks. Multiple input/output-points are located at the bottom of the racks. The stacker cranes transport bins between the input/output-points and cells on the racks to complete requests generated over time. Each request should be accomplished within its response time. The objective is to minimize the time by which all the generated requests are completed. Under a given physical layout, the authors study the complexity of the problem and design on-line algorithms for both one-stacker-crane model and two-stacker-crane model. The algorithms axe validated by instances and numerical simulations.
This paper considers an on-line scheduling and routing problem concerning the automated storage and retrieval system from tobacco industry. In this problem, stacker cranes run on one common rail between two racks. Multiple input/output-points are located at the bottom of the racks. The stacker cranes transport bins between the input/output-points and cells on the racks to complete requests generated over time. Each request should be accomplished within its response time. The objective is to minimize the time by which all the generated requests are completed. Under a given physical layout, the authors study the complexity of the problem and design on-line algorithms for both one-stacker-crane model and two-stacker-crane model. The algorithms are validated by instances and numerical simulations.