• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.506-513
• /
• 2000

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.8 no.2
• /
• pp.3-14
• /
• 1982

The purpose of this study is to establish the function of a sub-system for System Alternatives Feasibility Estimation (SAFE) in R & D Project Planning Phase (RDPPL). It is the fundamental function of the RDPPL/SAFE that selected an optimal planning system alternative of all, considered at RDPPL/SAS, by logical means in view of feasibility. In this paper, improving the function of RDPPL/SAFE, mathmatical models in order to quantify methods determining and integrating the feasibility funtion in each terminal system with a multi-stage process are examined.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.195-197
• /
• 2006

This paper presents new power development planning method. This method uses modified-OPF (Optimal Power Flow) includes attribution constrains. After solved the OPF, shadow prices of constraints are used making the weighting factors. These factors are used ordering new generators.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.100-102
• /
• 1992

Optimal generation dispatch algorithm is developed using L.P and load dispatch method. The algorithm is composed with three steps. Fist phase, analytical algorithm is adopted to solve to minimize quadratic cost functions which fits well for planning purpose. Second phase uses L.P method for obtain economic redispatch that satisfies line constraints. When there is no solution whitch satisfy line constraints load shedding algorithm solves the problem.

• Journal of Industrial Technology
• /
• v.5
• /
• pp.91-96
• /
• 1985

This paper presents a problem of a Wagner-Whitin type in which there are several options for setup and production in a period. Theorems that efficiently decrease the computational effort required to find optimal policies and a Planning Horizon Theorem are developed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.32
• /
• pp.233-242
• /
• 1994

This study deals with the derivative adverse minimum for inferiority system depends on continuose operating under infinite planning horizon. This planning will be accomplished by maintenance limit renewal policy in consideration of opportunity cost which affects system by failure during operation periods and expected cost under nomal operation states. By the results, we will be expected incresing total efficiency for the system by optimal renewal policy.

• Asian-Australasian Journal of Animal Sciences
• /
• v.12 no.2
• /
• pp.295-304
• /
• 1999

The planning and application of new developments in management of wastes. in hog farming is required to minimise the gaseous emissions from wastes and pollution of the aquatic environment. These strategies are enveloped in the "Farm Waste Management Plan" which identifies areas of the waste assets in form of plant nutrient and considers optimal manute collecting and storing procedures. The storage volumes for environmentally acceptable manure treatments and application methods are suggested. Good Waste Management Planning together with appropriate system design will ensure safe, reliable and effective waste handling.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.2
• /
• pp.15-23
• /
• 1985

A multi-product multi=facility production planning model is in which known demands must be satisfied. The model considers concave production costs and piecewise concave inventory costs in the introduction of production capacity constraints. Backlogging of unsatisfied demand is permitted. The structure of optimal production schedules is characterized and then used to solve an illustrative numerical problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.47-56
• /
• 1985

This paper considers a two-product three-facility production planning model, where facility 1 produces product 1 to satisfy its own market requirements and supplies input to facility 2, and facility 2 requires another input from facility 3 (outside supplier). The objective is to determine the optimal production amount in each period in order to satisfy the dynamic demands on time, which minimizes the total cost of production and storage. The set-up cost is incurred jointly from the multi-facility operations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.