• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.7-13
• /
• 2004

In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

• IE interfaces
• /
• v.12 no.2
• /
• pp.337-345
• /
• 1999

This paper presents the optimization of a drilling operation subject to machining constraints such as power, torque, thrust, speed and feed rate. The optimization is meant to minimize the machining time required to produce a hole. For the first time, the effects of a pilot hole are included in the formulation of the machining constraints. The optimization problem is solved by using the geometric programming technique. The dual problem is simplified based on the characteristics of the problem, and the effects of machining constraints on the machining variables are identified.

• Nuclear Engineering and Technology
• /
• v.7 no.2
• /
• pp.159-165
• /
• 1975

The Nuclear power industry today faces a serious and rapidly emerging problem in reactor maintenance and occupational radiation exposure control. The basic problem is the need for much maintenance on nuclear power plants. The problem is seriously compounded by radiation exposure control requirements. Many studies are underway seeking solutions tut the industry is developing rapidly and new plants will not await the results of such studies. It is essential that attention be given to maintenance and exposure control in all phases of plant design, construction and operation.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• Journal of Information Technology Services
• /
• v.16 no.2
• /
• pp.45-60
• /
• 2017

The study suggests a contract model of application operation through case study of A bank's IT outsourcing application contract based on workload. The IT outsourcing order form has a problem in that the scope of work is ambiguous due to the integration of operation and maintenance. In this study, application operation and maintenance were separated by referring to application operation history provided in ISO/IEC15504-5 standard. The scope of the IT outsourcing service was clarified by organizing the definition and detail activities of the application operation business. Application operation contract method has generally applied estimation method by the number of input manpower and period by agreement between buyer and client. As there is no activity to calculate the number of input manpower based on the operational work history and based on the standard workload per activity. In this case is not guaranteed due to the simple agreement between the contractors. In this paper, we propose an application operating cost estimation model that measures the size of the operating software using function point analysis that is the basis of application operation tasks. In order to verify the validity of the application operation cost model, we verified the correlation between the application size and the labor cost through regression analysis using SPSS.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.51-56
• /
• 2009

Flash memory has rapidly deployed as data storage. However, the flash memory has a major disadvantage that recorded data cannot be dynamically overwritten. In order to solve this "erase-before-write" problem, the log block buffer scheme used Flash memory file system. however, the current managements of the log buffer, in case random write pattern, BAST technique have problem of frequent merge operation, but FAST technique don't consider merge operation by frequently updated data. Previous methods not consider merge operation cost and frequently updated data. In this paper, we propose a new log buffer management scheme, called JBB. Our proposed method evaluates the worth of the merge of log blocks, so we conducts the merge operation between infrequently updated data and its data blocks, and postpone the merge operation between frequently updated data and its data blocks. Through the method, we prevent the unnecessary merge operations, reduce the number of the erase operation, and improve the utilization of the flash memory storage. We show the superiority of our proposed method through the performance evaluation with BAST and FAST.

• Proceedings of the KIEE Conference
• /
• 2002.11d
• /
• pp.330-333
• /
• 2002

Even if the train of subway starts in a certain interval from the origin according to the operation plan. as the number of passenger gets increased during operation. the boarding and getting-off time will increase, and the temporary breakdown happens to the system of train during operation, causing the delay from the operation plan. this leads to the vicious circle of train operation. making the interval of train operation irregular in downtown especially. To solve this problem, we propose the method of advanced algorithm by the actual data relating to the train operation including operation time required between stations, distance between stations. capability of train, and the dwelling time, location and distance between the preceding train and next one. The central train control system adjusts the dwelling time at each station in order to recover the delayed time, and increase the operation speed at the each station. As control algorithm is applied the dwelling time and to increase the speed, the train maintains certain interval after certain amount of time passes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.8
• /
• pp.1467-1472
• /
• 2011

This paper presents an optimal operation of microgrid systems and considering a tie-lines capacities that concerned each grid. The microgrid system consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile and wind resource for wind turbine generator were used for the study. For the grid interconnection, tie-line capacities were applied as constraints. The capacity constraints of tie-lines in production cost analysis are very important issues in the operation and planning of microgrid. In optimization, the Harmony Search (HS) algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.2
• /
• pp.251-258
• /
• 1994

To apply the Power MOSFET to the high powerd circuits, the parallel operation of the Power MOSFET must be considered because of their low power rating. This means, in practical applications, design methods for the parallel operations are required. However, it is very difficult to investigate the problem of parallel operations by directly changing the internal parameters of the MOSFET. Thus, in this paper, the effects of internal parameters for the parallel operation are investigated using SPICE program which is often used and known that the program is very reliable. The investigation results show that while the gate resistance and gate capacitances are the parameters which affect to the dynamic switching operations, the drain and source resistances are the parameters which affect to the steady-state current unbalances. Through this investigation, the design methods for the parallel operation of the MOSFET are suggested, which, in turn, contributes to the practical use of Power MOSFETs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.58
• /
• pp.17-27
• /
• 2000

In FMS where tool movement policy is adopted, a mathematical model has been developed which determines the selection of a tool type for each operation and tool loading-part assignment simultaneouly. The objective is to minimize the total cost of operation including machining time cost, tool cost, tool replacement and loading time cost, and tool change time cost. Due to the complexity of the problem, an approximate solution procedure has been developed utilizing the special structure of the model. Tool selection was determined first to allocate one tool type to each operation considering more than one tool type alternatives for each operation. Tool loading-part assignment was determined to minimize tile total number of tool changes due to part mix based on the tool selection.