共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
Scheduling block assembly in shipyard production poses great difficulties regarding the accurate prediction of the required spatial resource and effective production control for achieving managerial objectives due to the dynamic spatial layout and the stochastic nature of the production system. In this study, this dynamic space-constrained problem is viewed as two sequential decisions, namely rule-based dispatching and a static spatial configuration. A novel hybrid planning method is developed to employ discrete-event simulation as look-ahead scheduling to evaluate the system performance under various control policies. To rationalise block placement and improve long-term area utilisation, a discrete spatial optimisation problem is formulated and solved using an enumeration-based search algorithm, followed by the application of a series of heuristic positioning strategies. By imitation of the dynamic dispatching and spatial operation, a statistical analysis of the resultant performance can be conducted to select the best-performing priority rules. A case study with an experimental investigation is performed for a local shipyard to demonstrate the applicability of the proposed method. 相似文献
3.
In the small- and medium-sized shipbuilding companies, the skid system, which is a kind of slips located on flat seashore, is widely used. To improve the productivity of the skid, many shipbuilders adopt the semi-tandem system, under which a number of ships can be built on a skid simultaneously. The focus of the research reported in this paper is to develop an efficient spatial schedule for the skid system that uses the semi-tandem system. First, we develop a length-time, two-dimensional packing model for this problem and propose a heuristic algorithm to use the skid efficiently when the launching schedule for ships is given. Then, by combining this heuristic and the GA (genetic algorithm), we develop a hybrid GA algorithm to determine the launching schedule of ships as well as the spatial schedule for the skid, which maximises the number of ships that can be built on the skid and minimises delayed or early launching of each ship. Through performing a series of computational experiments, we finally show that the proposed algorithm can provide solutions of good quality very efficiently. 相似文献
4.
5.
6.
Material transportation scheduling problems concerning scheduling optimisation have been extensively investigated by researchers in such fields as industrial engineering and management science. Various algorithms have been proposed to solve such problems. However, the majority of these algorithms cannot be applied to a block transportation problem when a shipyard that uses a transporter, a large vehicle employed for moving weight, is considered. In this study, a hybrid optimisation algorithm is proposed for solving a block transportation problem when multiple transporters are used. With regards to the transporters, a minimisation of the travel distance without loading of and interference between the transporters is considered. A block transportation scheduling system is then developed based on the proposed algorithm. The developed system is applied to an actual block transportation scheduling problem of a shipyard. From the attained results, we demonstrate that the proposed algorithm has the ability to effectively solve the block transportation scheduling problems of a shipyard. 相似文献
7.
To overcome space restriction and to increase productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that is capable of lifting very heavy objects (up to 3600?tons) is used to handle the blocks which are the basic units in shipbuilding processes, and therefore, very large blocks (also called mega-blocks) can be used to build a ship, but because there are some positional restrictions under which the mega-block assembly yard can be constructed, the space is the scarcest resource in the process. The focus of the research reported in this paper is to develop an efficient spatial schedule for the mega-block assembly yard. First, we develop a length-time two-dimensional packing model for this problem. Since the optimisation model cannot be solved using an analytical method, we propose a GA-based heuristic algorithm using computational geometry theory. Through performing a series of computational experiments, we finally show that the proposed spatial scheduling algorithm can provide solutions of good quality very efficiently. 相似文献
8.
一种新的聚类分析距离算法 总被引:1,自引:0,他引:1
经研究发现现有聚类分析算法普遍存在聚类盲目性,而这又直接影响着聚类的质量.针对这一问题,本文以Parks距离算法为例,提出了一种改良的聚类分析距离算法,并将新距离算法应用在船舶装配产品归类中,经过对改良前后算法的比较,验证了新算法的优越性. 相似文献
9.
Efficient planning of the section building process is important for European shipyards since delays in this process can disrupt the on-time delivery of a ship. Automatically generating production schedules of the section building process can result in higher quality schedules compared to those created manually. Recently, the production processes of European shipyards have shifted to focus heavily on outsourcing and outfitting, yet existing automatic planning methods for section building fail to sufficiently consider these factors. This paper develops a mathematical model of the section building process which includes the effects of outfitting and outsourcing. The objective of this model is to simultaneously minimise the fluctuations in workload and the number of outsourced man-hours. The mathematical model was solved by implementing the non-dominated sorting generic algorithm-II (NSGA-II) using a custom heuristic as the fitness function. Due to the multi-objective nature of the problem definition and solution approach, a Pareto front of optimal solutions is created instead of a single, best solution. A test case showed that gains in both objectives are achievable compared to the planning developed manually. Implementing the Section Building Planning methodology developed in this paper could potentially improve the efficiency and controllability of the overall shipbuilding process. 相似文献
10.
针对传统造船模式下,车间作业计划与工艺设计串行工作方式的缺点,基于并行工程的原理,提出了分段作业计划与工艺设计的集成运行模式,为实现造船CAPP系统与PPC系统的集成化和并行化提供了实现的基础。针对集成模式的特点,建立了分段作业计划系统资源优化的数学模型,应用遗传算法解决了针对任意分段装配工艺方案的多资源平衡优化问题,可以得到每项作业最优的开工时间,同时能够给出多种资源的最优分布结果,满足了多工艺方案之间资源利用率的比较。最后,给出了计算实例,计算机模拟结果说明了这一方法的有效性。 相似文献
11.
12.
The block erection problem is defined as a parallel machine scheduling problem with precedence constraints and machine eligibility restrictions. A heuristic algorithm combined of the largest total amount of processing first rule (LTAP) and the enhanced smallest machine load first rule (ESML) is proposed to minimise makespan for the block erection in a shipyard. Finally, four lower bounds and the percentage of the reduced makespan compared with the current solutions are defined to evaluate the performance of the proposed algorithm. The experiments are performed on data selected from a shipbuilding company, and the results demonstrate that the presented algorithm can effectively find a good solution to minimise the makespan of the block erection problem. 相似文献
13.
Shipbuilding is a complex production system characterised by a complicated work and organisation structure, prolonged production lead time, and heterogeneous resource requirements. Thus, effectively planning all involved activities presents a challenging task and requires the timely coordination between the successive production stages at the plant level and effective resource allocation at the workshop level. With the work breakdown structure of all projects and their corresponding building strategies, the aggregate production planning (APP) is to address two important issues, namely, workforce level and inventory usage so that the fluctuating demands from downstream processes can be satisfied in a cost-effective manner. To achieve this, a novel APP model is proposed for ship production to minimise the variation of aggregate man-hour over the planning horizon and simultaneously minimise the logistic demands of the interim products. In view of the combinatorial nature and computational complexity, a directed genetic algorithm based solver has been developed to solve the two-conflicting-objective optimisation problem. The proposed approach has been applied to a case study and preliminary results have shown certain effectiveness in handling various situations with different planning strategies. 相似文献
14.
This study compares the performance of four different metaheuristics for solving a constraint satisfaction scheduling problem of the outfitting process of shipbuilding. The ship outfitting process is often unorganised and chaotic due to the complex interactions between the stakeholders and the overall lack of sufficiently detailed planning. The examined methods are genetic algorithms (GA), simulated annealing (SA), genetic simulated annealing (GSA) and discrete particle swarm optimisation (PSO). Each of these methods relies on a list scheduling heuristic to transform the solution space into feasible schedules. Although the SA had the best performance for a medium-sized superstructure section, the GSA created the best schedules for engine room double-bottom sections, the most complex sections in terms of outfitting. The GA provided the best scalability in terms of computational time while only marginally sacrificing solution quality. The solution quality of the PSO was very poor in comparison with the other methods. All methods generated schedules with sufficiently high resource utilisation, approximately 95%. The findings from this work will be incorporated into a larger project with the aim of creating a tool which can automatically generate an outfitting planning for a vessel. 相似文献
15.
Effective performance of modern manufacturing systems requires integrating process planning and scheduling more tightly, which is consistently challenged by the intrinsic interrelation and intractability of these two problems. Traditionally, these two problems are treated sequentially or separately. Integration of process planning and scheduling (IPPS) provides a valuable approach to improve system performance. However, IPPS is more complex than job shop scheduling or process planning. IPPS is strongly NP-hard in that, compared to an NP-hard job shop scheduling problem with a determined process plan, the process plan for each job in IPPS is also to be optimised. So, an imperialist competitive algorithm (ICA) is proposed to address the IPPS problem with an objective of makespan minimisation. An extended operation-based representation scheme is presented to include information on various flexibilities of process planning with respect to determined job shop scheduling. The main steps of the proposed ICA, including empires construction, assimilation, imperialistic competition, revolution and elimination, are elaborated using an illustrative example. Performance of the proposed ICA was evaluated on four sets of experiments taken from the literature. Computational results of the ICA were compared with that of some existing algorithms developed for IPPS, which validates the efficiency and effectiveness of the ICA in solving the IPPS problem. 相似文献
16.
考虑双机无等待流水作业调度问题,此问题中每台机器都受一个非可用时间的约束,工件都有不同的释放时间.机器的非可用性时间间隔是部分重叠并且已知.目标使Makespan(最大流程时间)最小.通过不同的方式计算上限和下限,完善分支定界法.计算机实验结果显示了所述方法的有效性. 相似文献
17.
编者按: 杨槱院士是我国造船学术界的老前辈,长期在学术和管理两个领域耕耘,成就卓著.本文讲的虽然是造船,但文中所谈到的一些基本观点,例如:关于造船(制造业)强国的标志;以人为本,加强工时定额管理;新产品的研究、开发是当务之急等,对我国其他企业也都有借鉴作用.本文是根据杨院士为某报准备的访谈发言稿摘编的,现征得杨院士的同意,特在本刊创刊10周年之际发表,以餐读者. 相似文献
18.
本文从建立船舶工业标准体系,应对国际标准新要求,标准化支撑船舶与海洋工程设计与建造、提升配套设备水平、加强船舶行业管理等方面,阐述了标准化发挥的支撑和引领作用,并研究讨论了未来船舶标准化的发展方向,强调大力发展船舶标准化对我国船舶工业实现由"大"到"强",早日成为世界造船强国具有重要意义。 相似文献
19.