Next Article in Journal
Investigating the Molecular Basis of N-Substituted 1-Hydroxy-4-Sulfamoyl-2-Naphthoate Compounds Binding to Mcl1
Next Article in Special Issue
Control Charts for Monitoring Process Capability Index Using Median Absolute Deviation for Some Popular Distributions
Previous Article in Journal
Filter Variable Selection Algorithm Using Risk Ratios for Dimensionality Reduction of Healthcare Data for Classification
Previous Article in Special Issue
Designing Supply Networks in Automobile and Electronics Manufacturing Industries: A Multiplex Analysis
Article

Integer Programming Scheduling Model for Tier-to-Tier Shuttle-Based Storage and Retrieval Systems

1
School of Mechanical Engineering, Shandong University, Jinan 250061, China
2
Key Laboratory of High Efficiency and Clean Mechanical Manufacture (Shandong University), Ministry of Education, Jinan 250061, China
3
Logistics Engineering in School of Control Science and Engineering, Shandong University, Jinan 250061, China
4
Whiting School of Engineering, Johns Hopkins University, Baltimore, MD 21218, USA
*
Author to whom correspondence should be addressed.
Processes 2019, 7(4), 223; https://doi.org/10.3390/pr7040223
Received: 4 March 2019 / Revised: 16 April 2019 / Accepted: 16 April 2019 / Published: 19 April 2019
Shuttle-based storage and retrieval systems (SBS/RSs), a new type of “part-to-picker” system, have attracted public attention because of their flexibility and robustness. The systems consist of two sub-systems—shuttles and lifts—which are responsible for horizontal movements and vertical movements, respectively. SBS/RSs are categorized into tier-to-tier shuttles and tier-captive shuttles. This paper mainly researches SBS/RSs with tier-to-tier shuttles. New challenges have emerged since the commercial simulation-based optimization software has become widely applied for, for instance, task scheduling problems. Specifically, to decrease the idle time of lifts and the waiting time of shuttles, an integer programming scheduling model is proposed to minimize total task time with constraints on orders and devices. The Gurobi linear programming solver was utilized to obtain the optimal order sequence and the shortest operation time. The overall system efficiency was improved using our model. Moreover, the results are significant for reducing capital investment and operating cost. View Full-Text
Keywords: tier-to-tier shuttle-based storage and retrieval system; integer programming scheduling model; Gurobi linear programming solver; task scheduling; optimization tier-to-tier shuttle-based storage and retrieval system; integer programming scheduling model; Gurobi linear programming solver; task scheduling; optimization
Show Figures

Figure 1

MDPI and ACS Style

Zhao, X.; Wang, Y.; Wang, Y.; Huang, K. Integer Programming Scheduling Model for Tier-to-Tier Shuttle-Based Storage and Retrieval Systems. Processes 2019, 7, 223. https://doi.org/10.3390/pr7040223

AMA Style

Zhao X, Wang Y, Wang Y, Huang K. Integer Programming Scheduling Model for Tier-to-Tier Shuttle-Based Storage and Retrieval Systems. Processes. 2019; 7(4):223. https://doi.org/10.3390/pr7040223

Chicago/Turabian Style

Zhao, Xiaofeng, Yanyan Wang, Yunge Wang, and Ke Huang. 2019. "Integer Programming Scheduling Model for Tier-to-Tier Shuttle-Based Storage and Retrieval Systems" Processes 7, no. 4: 223. https://doi.org/10.3390/pr7040223

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop