• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• Korean Journal of Construction Engineering and Management
• /
• v.14 no.5
• /
• pp.74-83
• /
• 2013

Most current BIM systems are focused on the visual information of work status in the design and construction stages. In a passive BIM system, 3D CAD tool can visualize the interference elements of design drawings, however, it cannot suggest a solution to solve the interference status. And 4D CAD tool in the construction stage can simulate the appearance of each activity by construction schedule, however, it cannot suggest an optimized schedule plan considering specified schedule condition of the project. Recently, many organizations need BIM solutions that can improve the work status beyond the level of simple visual information from BIM system. Active BIM system can provide the solutions to the project manager. This study suggests active BIM functions for the solutions and attempts to develop a 4D CAD engine to validate the usability of the functions.

• Korean Chemical Engineering Research
• /
• v.46 no.2
• /
• pp.316-329
• /
• 2008

Recently the increased attention pays on the processing of multiple, relatively low quantity, high value-added products resulted in adoption of batch process in the chemical process industry such as pharmaceuticals, polymers, bio-chemicals and foods. As there are more possibilities of the improvement of operations in batch process than continuous processes, a lot of effort has been made to enhance the productivity and operability of batch processes. But the chemical process industry faces a range of uncertainties factors such as demands for products, prices of product, lead time for the supply of raw materials and in the production, and the distribution of product. And global competition has made it imperative for the process industries to manage their supply chains optimally. Supply chain management aims to integrate plants with their supplier and customers so that they can be managed as a single entity and coordinate all input/output flows (of materials, information) so that products are produced and distributed in the right quantities, to the right locations, and at the right time.The objective of this study is to solve the purchase, distribution, production planning and scheduling problem, which minimizes the total costs of production, inventory, and transportation under uncertainty. And development of SCM model in chemical industry including batch mode operations. Through that, the enterprise can respond to uncertainty. Also integrated process optimal planning and scheduling model for manufacturing supply chain. The result shows that, the advantage of supply chain integration are quality matters seen by customers and suppliers, order schedules, flexibility, cost reduction, and increase in sales and profits. Also, an integration of supply chain (production and distribution system) generates significant savings by trading off the costs associated with the whole, rather than minimizing supply chain costs separately.

• Management & Information Systems Review
• /
• v.29 no.4
• /
• pp.109-121
• /
• 2010

In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

• Transactions of the KSME C: Technology and Education
• /
• v.2 no.2
• /
• pp.113-124
• /
• 2014

In developing an aircraft, configuration determination and requirement proofing depend on flight test results. Since the flight tests require much time and high cost, systematic flight test planning and analysis are needed to reduce cost and development time. This paper presents a desirability function approach to present an integrative measure of vibration levels at important positions and suggests a fractional factorial design which is one of the experimental design methods to help perform systematic flight tests. A method to perform flight tests in stages is also suggested to further reduce the number of flight tests.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.299-303
• /
• 2008

In this paper, we discuss the schedule problems for Korean Professional Baseball League (KPBL) and propose approaches to solve these problems by applying Integer Programming. A schedule in a sport league must satisfy lots of constraints on timing such as organizational, attractiveness, and fairness requirements. Organizational requirements cover a set of rules which have to guarantee that all the games can be scheduled according to the regulations imposed by Korean Baseball Organization (KBO). Attractiveness requirements focus on what stadium visitors, television spectators, and the clubs expect, that is, a varied, eventful, and exciting season. Fairness requirements have to guarantee that no team is handicapped or favored in comparison with the others. In addition to finding a feasible schedule that meets all the constraints, the problem addressed in this paper has the additional complexity of having the objective of minimizing the travel costs and every team has the balancing number of the games in home. We formalize the KPBL problem into an optimization problem and adopt the concept of evolution strategy to solve it. Using the method proposed, it is efficient to find better results than approaches developed before.

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

• Korean Chemical Engineering Research
• /
• v.44 no.2
• /
• pp.149-159
• /
• 2006

This research is a development of useful S/W program for real industry about optimal product scheduling in real plant for manufacturing polymer products. For this, we used a fine model with total amount of losses in weight(ton) as an objective for optimal scheduling and a genetic algorithm for optimization in this factory they manufacture three different products. Major products are A and B but the product which can be process in the period of products change over. They also sells them as a chap product in market. The major products have several types of packing process-bulk, pack for domestic market, pack for export. The demands of product with each packing type are increased, and frequently they failed keep the deadline for sail. Based on realistic production situation, we composed a fine modeling for optimal scheduling. And we also develop a S/W program for optimal scheduling which can be used by non-specialist in scheduling problem. We used a modified genetic algorithm and it gave us a better solution in process. We can have a result of reducing the total amount of losses in weight by half compared with the losses when existing production schedule.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.216-224
• /
• 2000

The spatial layout planning system allocates rectangular resources in the limited space according to user requirements, This system also can optimizes the spatial allocation problem to maximize the user's requirement. The spatial layout planning Problems for this system can be solved by searching a wide area of space since this problem entails the non-polynomial algorithm. By accommodating the user's dynamic requirements, the modification of a specific space and the redesign of the whole area can be accomplished. In this paper, the spatial layout planning problem is solved efficiently with a resource allocation method based on CSP. The dynamic constraints by adding user requirements are accommodated through the intelligent user Interface. The 3-D layout on the web environment by using VRML is also shown for providing for the visual verification of the 2-D layout and, thereafter, the additional modification of the 2-D layout.

• Journal of Korea Water Resources Association
• /
• v.42 no.8
• /
• pp.643-657
• /
• 2009

The major reason to construct large dams is to store surplus water during rainy seasons and utilize it for water supply in dry seasons. Reservoir storage has to meet a pre-defined target to satisfy water demands and cope with a dry season when the availability of water resources are limited temporally as well as spatially. In this study, a Hedging rule that reduces total reservoir outflow as drought starts is applied to alleviate severe water shortages. Five stages for reducing outflow based on the current reservoir storage are proposed as the Hedging rule. The objective function is to minimize the total discrepancies between the target and actual reservoir storage, water supply and demand, and required minimum river discharge and actual river flow. Mixed Integer Linear Programming (MILP) is used to develop a multi-reservoir operation system with the Hedging rule. The developed system is applied for the Han River basin that includes four multi-purpose dams and one water supplying reservoir. One of the fours dams is primarily for power generation. Ten-day-based runoff from subbasins and water demand in 2003 and water supply plan to water users from the reservoirs are used from "Long Term Comprehensive Plan for Water Resources in Korea" and "Practical Handbook of Dam Operation in Korea", respectively. The model was optimized by GAMS/CPLEX which is LP/MIP solver using a branch-and-cut algorithm. As results, 99.99% of municipal demand, 99.91% of agricultural demand and 100.00% of minimum river discharge were satisfied and, at the same time, dam storage compared to the storage efficiency increased 10.04% which is a real operation data in 2003.