• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.273-276
• /
• 2006

At an integrated steel mill, various raw material such as coal and iron ore are unloaded from a large ship. The unloaded raw material is then transported to storage yards through a complex belt conveyer network. We propose an optimization model for scheduling the unloading operations under the limitations of available berths, unloading equipments and transportation capacity of the belt conveyer network. We show that the problem is NP-Hard and propose a heuristic approach to the problem.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.7
• /
• pp.559-566
• /
• 2001

The sway control problem of the pendulum motion of a container hanging on the trolly, which transports containers from a container ship to trucks, is considered in the paper. In the container crane control problem, suppressing the residual swing motion of the container at the end of acceleration, deceleration or the case of that the unexpected disturbance input exists is main issue. For this problem, in general, the trolley motion control strategy is introduced and applied. In this paper, we introduce and synthesize a new type of swing motion control system in which a small auxiliary mass is installed on the spreader. The actuator reacting against the auxiliary mall applies inertial control forces to the container to reduce the swing motion in the desired manner. In this paper, we apply the $H^{\infty}$ based gain-scheduling control technique to the anti-swing motion control system design problem of the controlled plant. In this control system, the controller dynamics are adjusted in real-time according to time-varying plant parameters. And the simulation result shows that the proposed control strategy is shown to be useful for the case of time-varying system and, robust to disturbances such as winds and initial sway motion.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.342-349
• /
• 2011

This paper considers the inbound and outbound truck scheduling problem in a cross docking terminal. The unloading process from inbound trucks and loading process to outbound trucks are assumed to be performed within a time window. If some items are not able to be loaded to their scheduled outbound trucks within the time window, they are stored in the terminal and shipped using the truck visiting the next time window. The objective of this paper is to schedule inbound and outbound trucks to minimize the number of items unable to ship within the time window. A mathematical model for an optimal solution is derived, and a rule-based local search heuristic algorithm and genetic algorithm (GA) are proposed. The performance of the algorithms are evaluated using randomly generated several examples.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.919-930
• /
• 2000

This paper treats a development of visual interactive modeling(VIM) system for ship scheduling problem in integer formulation. The ship scheduling problem can be described as "A problem which assigns ships and cargos to achieve maximum revenue from transportation" in brief. Since late 1970s there has been rapid growth in development and use of VIM as MS10R technology due to the development of computer technology and now VIM has become a important discipline in MS/OR and MIS society. Visual Interactive Modeling is a process that decision maker takes part in modeling life cycle -data collection, formulation, derivation of optimal solution and representation of solution - and interacts with a modeling system to achieve a user-solution appropriate for his/her ultimate goal. This paper suggests the methodology how to collect data, build and modify model, and represent solution using computer graphics as a major driving tool and demonstrates effective performance of a prototype system.pe system.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.117-125
• /
• 2004

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.1-14
• /
• 2000

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

• Korean Management Science Review
• /
• v.17 no.1
• /
• pp.41-54
• /
• 2000

in the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• 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.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2011

This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.