Spatial scheduling optimization algorithm for block assembly in shipbuilding

DOI10.1155/2017/1923646zbMath1426.90137OpenAlexW2606810239WikidataQ59147340 ScholiaQ59147340MaRDI QIDQ1992436

Enock A. Duodu, Jinan Gu, Zhengyang Shang, Wei Ding

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/1923646

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry

Cites Work

• A new heuristic algorithm for rectangle packing
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• Dynamic reduction heuristics for the rectangle packing area minimization problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Spatial Planning: A Configuration Space Approach
• Orthogonal Packings in Two Dimensions
• SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING

This page was built for publication: Spatial scheduling optimization algorithm for block assembly in shipbuilding