• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.6
• /
• pp.646-655
• /
• 2008

A main issue about production management of shipyards is to efficiently manage the work in process and logistics. However, so far the management of a transporter for moving building blocks has not been efficiently performed. To solve the issues, optimal block transporting scheduling system is developed for minimizing of the travel distance without overload of a transporter. To implement the developed system, a hybrid optimization algorithm for an optimal block transportation scheduling is proposed by combining the genetic algorithm and the ant algorithm. Finally, to evaluate the applicability of the developed system, it is applied to a block transportation scheduling problem of shipyards. The result shows that the developed system can generate the optimal block transportation scheduling of a transporter which minimizes the travel distance without overload of the transporter.

• Journal of Navigation and Port Research
• /
• v.38 no.3
• /
• pp.299-305
• /
• 2014

In a ship-building, a transporter is the moving equipment to transport ship blocks from a workshop to another in a shipyard. The efficient scheduling of transporters has an important role for the operation of a building ship to be completed on schedule. There are the previous studies on the transporter scheduling for moving blocks in a shipyard. These studies have no consideration for the transporter combination to increase the productivity of moving blocks. This paper presents an efficient transporter scheduling model considering transporter combination explicitly. The objective of this model is to minimize the operational cost and maintain the workload balance among transporters. we also present three heuristics algorithms based on tabu search for finding the solution of the model. The efficiency of the proposed heuristics are verified with several computational tests.

• IE interfaces
• /
• v.21 no.3
• /
• pp.274-282
• /
• 2008

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times : 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

• IE interfaces
• /
• v.22 no.1
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2013.06a
• /
• pp.216-217
• /
• 2013

대형 조선소에서 하루 수십, 수백 개의 블록 이동이 있고 이동량이 많아지면 트랜스포터의 수, 운전기사, 신호수의 요구 증가를 야기해 비용 증가에 영향을 미친다. 또한 조선소에서 블록 이동은 공정 사이의 흐름에 영향을 미치며 전체 일정을 지연시킬 수도 있다. 그러므로 잘짜여진 블록 이동문제는 생산성 증가과 총 비용 감소에 있어 중요하다. 트랜스포터를 이용하여 블록을 이동하는데 트랜스포터란 고가의 특수운반차량으로 조선소에서 종류별(수백톤급)로 보유하고 있다. 트랜스포터는 가용 중량 이상의 블록을 이동할 수 없는데 이 때 두 대 이상의 차량을 결합하여 운반할 수 있다. 본 연구에서는 블록 무게와 트랜스포터의 적재 용량을 고려한 트랜스포터의 일정계획 문제를 다룬다. 계획된 공정 시간에 맞춰 블록이 도착할 수 있도록(지연시간 최소화)하는 모형을 정의하고 휴리스틱 알고리즘을 제안한다. 그리고 실험을 통해 최적화 모형과 휴리스틱 알고리즘의 효과를 검증하고자 한다.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2010

Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.119-135
• /
• 1995

We consider problems of tool loading and scheduling in a flexible manufacturing system (FMS) in which tool transportation constitutes the major portion of material flows. In this type of FMSs, parts are initially assigned to machines and released to the machines according to input sequencing rules. Operations for the parts released to the machines are performed by tools initially loaded onto the machines or provided by an automatic tool transport robot when needed. For an efficient operation of such systems, therefore, we may have to consider loading and scheduling problems for tools in addition to those for parts. In this paper, we consider three problems, part loading, tool loading, and tool scheduling problems with the overall objective of minimizing the makespan. The part loading problem is solved by a method similar to that for the bin packing problem and then a heuristic based on the frequency of tool usage is applied for tool loading. Also suggested are part input sequencing and tool scheduling rules. To show the effectiveness of the overall algorithm suggested here, we compare it with an existing algorithm through a series of computational tests on randomly generated test problems.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.3
• /
• pp.187-195
• /
• 2017

The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.1
• /
• pp.59-69
• /
• 2018

The up-to-date business environment for Korean manufacturers is very complex and rapidly changing. Especially, the companies have faced with various changes derived from small quantity batch production, diversification of customer demands, and short life cycles of products. Consequently, the Korean manufacturing companies are in need of more efficient production planning and scheduling techniques. In this paper, the research trend of scheduling techniques is investigated to provide relevant information to researchers in this field. Furthermore, some implications for future researches are presented regarding literatures published in Korea over the last 10 years. This paper presents an entire investigation into Korean research works on scheduling (2,569 papers) that are published from 2007 to 2016. Especially, detailed analysis was carried out in the following three industry : 1) semiconductor, 2) shipbuilding and 3) automobile. In this paper, approaches to scheduling presented in the literature are categorized into the following three categories : 1) application, 2) algorithm, and 3) simulation modeling. First, in the semiconductor industry, scheduling techniques related to semiconductor cleaning processes, photolithography processes, chemical processes, transport and transport equipment have been found to be dominant. Second, the shipbuilding industry is focused on assembly processes, transporter, crane and various existing production management system. On the other hand, the scheduling research of the automobile industry is mainly focused on the vehicle movement routing and procurement supply-chain planning algorithm in terms of logistics. The conclusion of this study are expected to provide many implications for various types of academic and practical follow-up studies related to scheduling in consideration of main characteristics of semiconductor, shipbuilding and automobile industries.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.12
• /
• pp.49-56
• /
• 2023

In this study, we propose a genetic algorithm (GA) to optimize the allocation and operation order of transporters. The solution in the GA is represented by a set of lists each of which the operation order of the corresponding transporter. In addition, it was implemented in the form of a hybrid genetic algorithm combining effective local search operations for performance improvement. The local search reduces the number of operating transporters by moving blocks from a transporter with a low workload into that with a high workload. To evaluate the effectiveness of the proposed algorithm, it was compared with Multi-Start and a pure genetic algorithm through a simulation environment similar in scale to an actual shipyard. For the largest problem, compared to them, the number of transporters was reduced by 40% and 34%, and the total task time was reduced by 27% and 17%, respectively.