Research on block storage yard scheduling according to grid method. (29th November 2019)

• Record Type: Journal Article
• Authors: Zhou, Hong‐gen; Wang, Zhen; Liu, Jin‐feng; Tian, Gui‐zhong; Jing, Xu‐wen; Li, Lei
• Other Names: Xu Zheng guestEditor.; Zhou Qingyuan guestEditor.; Dong Fang guestEditor.; Yong Jianming guestEditor.; Fei Xiang guestEditor.
• Is Part Of: Concurrency and computation. Volume 32:Number 23(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-11-29
• Subjects: block storage -- grid search algorithm -- heuristic rules -- plan scheduling; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5576
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: In order to solve the problems of low utilization of the shipyard unreasonable placed of the blocks and unbalanced use of flat transporters, grid search algorithm for block storage yard scheduling is proposed. Firstly, the information of block storage yard and each block are described by the method of bitmap; secondly, the blocks access sequence, stacking principles of the blocks, and the principles of flat transporters are developed based on heuristic rules and shape differences of the blocks; finally, the grid search algorithm is proposed for the scheduling of shipyard's plan. It has been demonstrated in some shipyard; the results show that the utilization rate of the yard space and the efficiency of block storage yard scheduling have been improved greatly, and the situation of manpower and material resources waste have been decreased fully.