• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.424-433
• /
• 2009

In order to improve productivity and efficiency of ship production process, production technology converged with Information Technology can be considered. Mid-term scheduling based on long-term schedule of ship building and execution planning based on short-term production schedule have an important role in ship production processes and techniques. However, data used in the scheduling are from the experiences of the past, cognitive, and often inaccurate, moreover the updates of the data by formatted documents are not being performed efficiently. This paper designs the tracking and monitoring system for the curved plates forming process with shop level. At first step to it, we redefine and analyze the curved plates forming process by using SysML. From the definition and analysis of the curved plates forming process, we design the system with respect to operational view considering operational environment and interactions between systems included and scenario about operation, and with respect to system view considering functionalities and interfaces of the system. In order to study the feasibility of the system designed, a prototype of the system has been implemented with 13.56 MHz RHD hardware and application software.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.2
• /
• pp.305-314
• /
• 2017

Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.237-242
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. To cope with this problem, this paper deals with the development of an agent for selecting an optimal order set automatically. The main engine of selection agent is based on the typical job-shop scheduling model since our target domain is the injection molding company. To solve the problem, we have formulated it as IP (Integer Program) model, and it has been successfully implemented by ILOG and selection agent. And we have suggested an architecture of an agent for tackling web based order selection problems.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.6
• /
• pp.642-647
• /
• 2014

In this paper, a hybrid genetic algorithm (HGA) approach is proposed for an n-job, m-machine flow shop scheduling problem with limited capacity buffers with blocking in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. HGA adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms (GAs). Extensive computational experiments have been conducted to compare the performance of HGA with that of GA.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.163-171
• /
• 2006

This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

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

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.127_128
• /
• 2009

A new technique using a search method which is based on fuzzy multi-criteria function is proposed for GMS(generator maintenance scheduling) in order to consider multi-objective function. Not only minimization of probabilistic production cost but also maximization of system reliability level are considered for fuzzy multi-criteria function. To obtain an optimal solution for generator maintenance scheduling under fuzzy environment, fuzzy multi-criteria relaxation method(fuzzy search method) is used. The practicality and effectiveness of the proposed approach are demonstrated by simulation studies for a real size power system model in Korea in 2010.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.159-164
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots and then scheduling these sublots in order to accelerate the completion of jobs in a multi-stage production system. Anew genetic algorithm (NGA) is proposed for an-job, m-machine, equal-size sublot lot-streaming flow shop scheduling problem with delivery windows in which the objective is to minimize the mean weighted absolute deviation of job completion times from due dates. The performance of NGA is compared with that of an adjacent pairwise interchange (API) method and the results of computational experiments show that NGA works well for this type of problem.