{'fraction_non_alphanumeric': 0.01608325449385052, 'fraction_numerical': 0.0, 'mean_word_length': 5.151162790697675, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A dynamic scheduling method for spatial layout planning

A dynamic scheduling approach for the spatial layout planning for block assembly in shipbuilding industry is proposed in this paper. Within a period of planning horizon, the whole procedure of the scheduling problem is composed of the pre-scheduling algorithm and the spatial planning by genetic algorithm (GA). The first part generates the initial set of blocks with respect to every working space by considering spatial constraints, due time of blocks and workload balance among the working space. In the spatial planning algorithm, GA is proposed to further realize the spatial layout of the initial set of blocks obtained in the pre-scheduling algorithm at a period in a working space. Because several locatable strategies such as rotation mechanism, edging strategy, rearrangement strategy have been designed to realize in the genetic operations, the feasible locatable point set can be found by GA. Finally, a simulation example is examined to show the validity of the proposed hybrid approach.