Research on irregular block spatial scheduling algorithm in shipbuilding

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses the spatial scheduling problem for irregular blocks with purpose of determining the optimal schedule of a given set of irregular blocks and the layout of workplaces by designating the blocks’ workplace simultaneously. Workspace and irregular blocks are described using two-dimensional homogeneous grid. On this basis, the problem is formulated as an optimization model with objectives to minimize duration and to balance workloads over workplaces. A hybrid spatial scheduling algorithm based on genetic algorithm and simulated annealing algorithm is proposed in which the heuristic decoding strategy using vertex positioning and bottom-left moving rules are used. The comparison and computational results shows the proposed hybrid algorithm solves the irregular block spatial scheduling problems effectively and efficiently.

Cite

CITATION STYLE

APA

Zhang, Y., & Ci, H. (2019). Research on irregular block spatial scheduling algorithm in shipbuilding. In Advances in Intelligent Systems and Computing (Vol. 885, pp. 1130–1136). Springer Verlag. https://doi.org/10.1007/978-3-030-02804-6_146

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free