• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11c
• /
• pp.764-769
• /
• 2000

A new transplant production system that produces high quality plug seedlings of specific crop has been studied. It is a plant factory designed to produce massive amount of virus free seedlings. The design concept for building this plant factory is to realize maximum energy efficiency and minimum initial investment and running cost. The basic production strategy is the sitespecific management. In this case, the management of the growth of individual plantlet is considered. This requires highly automated and information intensive production system in a closed aseptic environment the sterilized specific crops. One of the key components of this sophisticated system is the irrigation system. The conditions that this irrigation system has to satisfy are: 1. to perform the site specific crop management in irrigation and 2. to meet the no waste standard. The objective of this study is to develop an irrigation scheduling that can implement the no waste standard.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.158-173
• /
• 1993

The formulated mechanization packages for grain maize production have performed to the expected limit generating encouraging information. Besides physical feasibility , management factors viz ; production operation sequence, operations scheduling and machinery matching with respect to environment can still limit system suitability. A new production operation sequence was introduced to overcome weed problems and limitations of available working days. Proper operations scheduling will improve the initial soil-crop environment for better seedling establishment, and reduce the (). been identified as key factors to reduce capital investment and cost of proudction .

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.125-125
• /
• 1991

This paper presents a framework for the hierarchical PPC(Production Planning and Control) in make-to-order environment with job shop. The characteristics of the environment are described as : 1) project with non-repetitive and individual production, 2) short delivery date, 3) process layout with large scales manufacturing. 4) job shops. The PPC in a make-to-order typically are organized along hierarchical fashions. A model is proposed for the hierarchical job shop scheduling based on new concepts of production system, work and worker organization. Then, a new integrated hierarchical framework is also developed for the PPC based on concepts of the proposed job shops scheduling model. Finally, the proposed framework has been implemented in the Electric Motor Manufacturing and the results showed good performance.

• Korean Management Science Review
• /
• v.16 no.2
• /
• pp.125-135
• /
• 1999

This paper presents a framework for the hierarchical PPC(Production Planning and Control) in make-to-order environment with job shop. The characteristics of the environment are described as : 1) project with non-repetitive and individual production, 2) short delivery date, 3) process layout with large scales manufacturing. 4) job shops. The PPC in a make-to-order typically are organized along hierarchical fashions. A model is proposed for the hierarchical job shop scheduling based on new concepts of production system, work and worker organization. Then, a new integrated hierarchical framework is also developed for the PPC based on concepts of the proposed job shops scheduling model. Finally, the proposed framework has been implemented in the Electric Motor Manufacturing and the results showed good performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.4
• /
• pp.130-137
• /
• 2013

In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.51-61
• /
• 2008

In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.195-204
• /
• 2003

Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.4
• /
• pp.373-381
• /
• 2006

This paper considers a scheduling problem for a hybrid flowshop with dynamic order arrival. A hybrid flowshop is an extended form of a flowshop, which has serial stages like a flowshop but there can be more than one machine at each stage. In this paper, we propose a new method for the problem of scheduling with the objective of minimizing mean tardiness of orders which arrive at the shop dynamically. The proposed method is based on the list scheduling approach, however we use a more sophisticated method to prioritize lots unlike dispatching rule-based methods. To evaluate the performance of the proposed method, a simulation model of a hybrid flowshop-type production system is constructed. We implement well-known dispatching rules and the proposed methods in the simulation model. From a series of simulation tests, we show that the proposed methods perform better than other methods.

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

• IE interfaces
• /
• v.14 no.4
• /
• pp.394-402
• /
• 2001

In this study, we deal a spatial scheduling system for the block painting process in the shipbuilding industry. In general, the spatial scheduling for the block painting process is a very complicated task. Because spatial allocation of each block in blasting and painting cells is considered simultaneously. Thus the spatial scheduling for the block painting process is the problem of planning and control of operation, which arises in shipyard. This system is developed for blocks to meet the delivery date given by the shipyard production planning system, to maximize space utilization of blasting and painting cells and to balance workload among working teams. And it has been tested using actual scheduling data from a shipyard and successfully applied in a paint shop in a shipbuilding company.