Research on block storage yard scheduling according to grid method

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation 2020-12, Vol.32 (23), p.n/a
Hauptverfasser: Zhou, Hong‐gen, Wang, Zhen, Liu, Jin‐feng, Tian, Gui‐zhong, Jing, Xu‐wen, Li, Lei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.5576