Spatial scheduling optimization algorithm for block assembly in shipbuilding
type: Item
instance of: scholarly article
title: Spatial scheduling optimization algorithm for block assembly in shipbuilding
zbMATH Open document ID: 1426.90137
DOI: 10.1155/2017/1923646
author: Zhengyang Shang
author: Jinan Gu
author: Wei Ding
author: Enock A. Duodu
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: Block assembly consumes the majority of processing time and resources in shipbuilding, and the block spatial scheduling (BSS) related to block assembly has been widely studied as the key to improve shipbuilding efficiency. BSS is a complicated NP-hard problem that aims to minimize the makespan. Since each block has specific building time and space constraints, the BSS problem can be hardly found with an acceptable solution by using constant scheduling rules. Thus, in this study, we considered the BSS problem as a time-constrained 3D bin packing mathematical model and proposed an allocation algorithm, best contact algorithm (BCA), that is more suitable for dynamic processes. Then, for global optimization of the BSS problem, we regarded the starting time of each block as a variable and used the genetic algorithm (GA) to operate and optimize the block assembly sequence. Finally, we tested the BCA + GA scheduling system with real data from a shipyard and thereby determined the block scheduling status and the daily utilization rate of the work plate. Comparison shows that the proposed algorithm is able to get shorter makespan and better block scheduling effect; it realized the optimization of the block spatial scheduling dynamically.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6971819
Wikidata QID: Q59147340
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/1923646
OpenAlex ID: W2606810239
cites work: Spatial Planning: A Configuration Space Approach
cites work: SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING
cites work: Orthogonal Packings in Two Dimensions
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A new heuristic algorithm for rectangle packing
cites work: An efficient deterministic heuristic for two-dimensional rectangular packing
cites work: Dynamic reduction heuristics for the rectangle packing area minimization problem
description: scientific article; zbMATH DE number 6971819