• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.63-73
• /
• 2008

The aim of study is to analyze the berth occupancy rate according to the ship size. P Iron and steel company operate exclusive bulk terminal at P port and G port and the depth of water at berth are not so equal each other. And to reduce the sea transport cost between loading port and unloading port P and G, P company increases the number of large ship while ship scheduling. But it causes to increase the berth congestion at the specific water depth berth owing to the draught of large ship. At this point, usually ship waiting time starts to rise even at low levels of berth occupancy rate, and will rise more and more sharply at the level of full utilization. But it is not common at exclusive terminal like P port and G port. Bulk ships arrive at port according to the early planned arrival time and the coefficient of variation of ship arrival time is not so big. So queueing time at exclusive terminal does not rise sharply near 80-90 berth occupancy rate.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1994.04a
• /
• pp.29-42
• /
• 1994

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.323-333
• /
• 2001

This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.

• Journal of the Society of Naval Architects of Korea
• /
• v.44 no.1 s.151
• /
• pp.48-54
• /
• 2007

Higher productivity and less cost during the manufacturing process of ships are required to maintain international competitiveness of modern shipbuilding industries. The integrated hull/ outfitting/ painting scheduling(IHOP) process is a final point, where logistics are finally being integrated and upcoming schedules are made. Therefore, more profits are expected from IHOP by effective management. In this thesis, IHOP is proposed in order to solve how to choose block erection date with IHOP scheduling logic. The result of IHOP scheduling is highly advised to utilize fabrication, outfitting shops. A standardized operation and load of resource will eventually be applied in long-term time span point of view for this will make it easy to enable capacity planning and workforce planning. It is also expected to eliminate inefficiency in overtime work and efficiently utilize manpower in short-term.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.143-155
• /
• 2012

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience. To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1585-1592
• /
• 2015

Currently, the existing schedule management of ship repair has depended on hand-written notes of engineering manager in the repair ship yard. Simple management based on the hand-written notes is inefficient because current states of equipments and staff are not graspable in real-time. To solve this problem, the ICT based scheduling method is required in ship repair industry. In this paper, we propose a system based on ICT which manages schedules for repairing ships. The proposed system solves the problem occurred by the management to use the hand-written notes. Because the system has a function to report the current state of ship repair, it is able to cope with various problems, such as delay, wrong repair and so on. Moreover, the system is able to maximize the efficiency of ship repair process due to efficient management to staff and equipment.

• Journal of Ocean Engineering and Technology
• /
• v.29 no.3
• /
• pp.263-269
• /
• 2015

This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.1-5
• /
• 2015

In this study, we consider the transportation problem in port container terminals. It aims to determine positions in yards to place the containers at the adequate times. The containers on ship must be unloaded one by one from top to bottom, and placed in the main yard in order to reduce additional cost required for unnecessary unloading when getting out by customer with given timetable. The cost for transportation at container terminals could be reduced by a new approach in scheduling: move the containers from ship and stack them onto main yard that minimizes cost of yard crane operation when unloading for customer.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.6 no.1
• /
• pp.162-174
• /
• 2014

Most shipbuilding scheduling research so far has focused on the load level on the dock plan. This is because the dock is the least extendable resource in shipyards, and its overloading is difficult to resolve. However, once dock scheduling is completed, making a plan that makes the best use of the rest of the resources in the shipyard to minimize any additional cost is also important. Block assignment planning is one of the midterm planning tasks; it assigns a block to the facility (factory/shop or surface plate) that will actually manufacture the block according to the block characteristics and current situation of the facility. It is one of the most heavily loaded midterm planning tasks and is carried out manually by experienced workers. In this study, a method of representing the block assignment rules using a diagram was suggested through analysis of the existing manual process. A block allocation program was developed which automated the block assignment process according to the rules represented by the diagram. The planning scenario was validated through a case study that compared the manual assignment and two automated block assignment results.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1996.04a
• /
• pp.59-76
• /
• 1996

Vessels in the world merchant fleet generally operate in either liner or bulk trade. The supply and the demand trend of general cargo ship are both on the ebb however those trend of tankers and containers are ins light ascension. Oil tankers are so far the largest single vessel type in the world fleet and the tanker market is often cited as a texbook example of perfect competition. Some shipping statistics in recent years show that there has been a radical fluctuation in spot charter rate under easy charter's market. This implies that the proper scheduling of tankers under spot market fluctuation has the great potential of improving the owner's profit and economic performance of shipping. This paper aims at developing the TS-DSS(Decision Support System for Tanker Scheduling) in the context of the importance of scheduling decisions. TS-DSS is defined as a DSS based on the optimization models for tanker scheduling. The system has been developed through the life cycle of systems analysis design and implementation to be user-friendly system. The performance of the system has been tested and examined by using the data edited under several tanker scheduling has been tested and examined by using the data edited under several tanker scheduling scenarios and thereby the effectiveness of TS-DSS is validated satisfactorily. The authors conclude the paper with the comments of the need of appropriate support environment such as data-based DSS and network system for successful implementatio of the TS-DSS.