Abstract
With the increasing competition of market economies, many companies are pursuing higher levels of production automation in manufacturing industry. For example, the automated warehouses are employed in the field of manufacturing and processing field, in the process of which automated warehouses play a more and more significant role. Therefore, it is meaningful to have a research on the automated warehouses scheduling issue. The warehouse scheduling algorithm is studied combining with the project on the automatic production line of an enterprise in this paper, and a warehouse scheduling optimization algorithm is proposed based on IOQ(Index of Quality) parameters. Then the process of getting the value of IOQ is also simplified by applying the idea of sparse matrix. In addition, the algorithm uses the maximum of the IOQs to schedule warehouse on line, and is compared with other warehouse scheduling algorithms. The simulation results show that the warehouse scheduling algorithm can not only improve the quality of the product effectively, but also improve the efficiency of the scheduling largely. The desired result is achieved in the end.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hu, G., Kise, H., Xu, Y.: Optimization for input/output scheduling for automated warehouses. Transactions of the Society of Instrument and Control Engineers 18(4), 156–163 (2005)
Tian, G.H., Zhang, P., Yin, J.Q.: Research on the fixed shelf order picking optimization problem using a kind of hybrid genetic algorithm. Chinese Journal of Mechanical Engineering 40(2), 141–144 (2004)
Li, M.J., Chen, X.B., Liu, C.Q.: Pareto and Niche Genetic Algorithm for Storage Location Assignment Optimization Problem. In: The 3rd International Conference on Innovative Computing Information and Control, pp. 465–465 (2008)
Chang, F.L., Liu, Z.X.: Research on Order Picking Optimization Problem of Automated Warehouse. System Engineering-Theory & Practice (2), 139–143 (2007)
Wang, C., Zeng, M.M., Li, J.: Solving traveling salesman problems with time windows by genetic particle swarm optimization. In: IEEE World Congress on Computational Intelligence, pp. 1752–1755 (2008)
Cao, Q.H., Di, X.K.: A simulated annealing methodology to estate logistic warehouse location selection and distribution of customers’ requirement. In: International Workshop on Intelligent Systems and Applications, pp. 1–4 (2009)
Shi, X.L., Bai, S.W., Tan, Y.: Research on task scheduling in AS/RS. Logistics Technology (3), 29–32 (2004)
Whitely, L.D., Howe, A.E.: Comparing Heuristic Search Methods and Genetic Algorithms for Warehouse Scheduling. Systems, Man, and Cybernetics (3), 2466–2471 (1998)
Ascheuer, N., Martin, G., Abdel-Hamid, A.-A.A.: Order picking in an automatic warehouse Solving online asymmetric TSPs. Mathematical Methods of Operations Research 49(3), 501–515 (1999)
Gademann, N., Van De Velde, S.: Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Transactions 37(1), 63–75 (2005)
Lin, Q., Iyer, B.R.: Automated storage management with QoS guarantees. In: Proceedings of the 22nd International Conference on Data Engineering, p. 150 (2006)
Kim, B.-I., Heragu, S.S.: A Hybrid Scheduling and Control System Architecture for Warehouse Management. IEEE Transactions on Robotics and Automation 19(6), 991–1001 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, W., Fei, M. (2012). Modeling and Verification of Warehouse Dynamic Scheduling Based on the IOQ Parameter of the Product. In: Xiao, T., Zhang, L., Fei, M. (eds) AsiaSim 2012. AsiaSim 2012. Communications in Computer and Information Science, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34384-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-34384-1_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34383-4
Online ISBN: 978-3-642-34384-1
eBook Packages: Computer ScienceComputer Science (R0)