• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.120-125
• /
• 2005

In this paper, We propose the fuzzy controller for the gain tuning of PID controller The proposed controller doesn't use the crisp output error and rule tables though with a fuzzy inference process in forward fuzzifier, New Fuzzy PID Controller assigns relations and ranges of two variables of PID gain parameters. These new gain parameters are calculated by the fuzzy inference with max-min ranges of Kp and Kd. The Ki parameter is computed automatically between Kp and Kd parameter Is calculated by Ziegler-Nickels tuning rules. Finally we experimented the propose controller by the hydraulic servo motor control system. We can obtained desired results through the good control characteristics.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.05a
• /
• pp.343-354
• /
• 2004

A Project planning is one of the most important processes that determines success and failure of the project. Scope management for project planning is also essential job in system integration project. However project planning is very difficult because lots of factor and their relationships should be considered. Therefore project planning of SI project has been done by project manager s own knowledge and experiences. It is necessary to develop an algorithm of WBS(Work Breakdown Structure) identification & document selection along to project's specificity in project management system using AI technique. This study also present method (ODW model) to cope with the limitations of the existing study that has uniformly customizing the methodology by only project complexity. We propose PPSM(Project planning support module) that apply Rule for determination of route map and document level, and CBR for WBS identification.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.26-33
• /
• 2006

The potential needs as well as visible needs of customer should be considered in order to research and analyze of the customer data. The methods to analyze customer data is classified into customer segmentation, clustering analysis model, forecasting customer response probability model, analysis of the customer break rate model and new customer analysis model by the purpose. In this study, we developed the CW-CLV (Correlation Weight Customer Lifetime Value)method that used AHP(Analytic Hierarchy Process)rule for enhance the reliability of customer data and quantitative analysis of the customer segmentation, based on CLV(Customer Lifetime Value). We suggest to new variables and methodology from determined CW-CLV coefficients, because all of companies respect to the diversified customers classification and complexity of consumers needs. Finally, we unfolded any company's scheduling added new methodology using simulation and leaded conclusion about the new methodology.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.45-54
• /
• 2010

The inherent complexity of semiconductor fabrication processes makes it hard to solve well-known job scheduling problems in analytical ways, which leads us to rely practically on discrete event modeling simulations to learn the effects of changing the system's parameters. Meanwhile, unpredictable disturbances such as machine failures and maintenance diminish the productivity of semiconductor manufacturing processes with fixed scheduling policies; thus, it is necessary to adapt job scheduling policy in a timely manner in reaction to critical environmental changes (disturbances) in order for the fabrication process to perform optimally. This paper proposes an adaptive job control framework for a wafer fabrication process in a control system theoretical approach and implements it based on a DEVS modeling simulation environment. The proposed framework has the advantages in view of the whole systems understanding and flexibility of applying new rules compared to most ad-hoc software approaches in this field. Furthermore, it is flexible enough to incorporate new job scheduling rules into the existing rule set. Experimental results show that this control framework with adaptive rescheduling outperforms fixed job scheduling algorithms.

• Journal of the Society of Naval Architects of Korea
• /
• v.60 no.3
• /
• pp.202-211
• /
• 2023

The profile shops in shipyards produce section steels required for block production of ships. Due to the limitations of shipyard's production capacity, a considerable amount of work is already outsourced. In addition, the need to improve the productivity of the profile shops is growing because the production volume is expected to increase due to the recent boom in the shipbuilding industry. In this study, a scheduling optimization was conducted for a parallel welding line of the profile process, with the aim of minimizing tardiness and the number of set-up changes as objective functions to achieve productivity improvements. In particular, this study applied a dynamic scheduling method to determine the job sequence considering variability of processing time. A Markov decision process model was proposed for the job sequence problem, considering the trade-off relationship between two objective functions. Deep reinforcement learning was also used to learn the optimal scheduling policy. The developed algorithm was evaluated by comparing its performance with priority rules (SSPT, ATCS, MDD, COVERT rule) in test scenarios constructed by the sampling data. As a result, the proposed scheduling algorithms outperformed than the priority rules in terms of set-up ratio, tardiness, and makespan.

• Journal of Welding and Joining
• /
• v.24 no.5
• /
• pp.62-66
• /
• 2006

Panel line is an important process occupying the largest work amount in shipbuilding. In this research product simulation has been carried out to establish the optimal production scheduling. For this purpose a web-based panel line simulator was developed using an object modeling technology and C# language. The balance of work-load and increase in the productivity by the improvement of production facilities and process are the key factors for a good scheduling. In this study SPRT(Shortest Remaining Process Time) rule was applied for the work-load balancing and a good result achieved. To increase the productivity in the stiffener welding stage which is a bottleneck; process, more welding heads and higher welding speed were tested using the developed simulator. The simulation results showed that either more welding head or higher welding speed decreased the total work time. Use of both, however, deteriorated the productivity because of the bottleneck in the following stage. This result points out that the improvement of production facilities and/or process should be evaluated with their influences on the leading and following processing stage.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.11-18
• /
• 2016

This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4174-4181
• /
• 2010

This paper presents an adaptive scheduling algorithm for manufacturing processes with non-stationary rework probabilities. The adaptive scheduling scheme named by hybrid Q-learning algorithm is proposed in this paper making use of the non-stationary rework probability and coupling with artificial neural networks. The proposed algorithm is measured by mean tardiness and the extensive computational results show that the presented algorithm gives very efficient schedules superior to the existing dispatching algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.9
• /
• pp.12-19
• /
• 2002

Guaranteed Frame Rate(GFR) service is intended to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. The original GFR proposal outlined two switch implementation scheme : FIFO Queuing and perVC-Queuing. In general, it has been shown that FIFO Queuing is not sufficient to provide rate guarantees and perVC-Queuing with scheduling is needed. In perVC-Queuing implementation, scheduling algorithm plays key rule to provide rate guarantees and to improve fairness. We proposed a new scheduling algorithm for the GFR service. Proposed algorithm can provide minimum service rate guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP Goodput and fairness than previous scheme.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.11
• /
• pp.973-980
• /
• 2016

An air traffic management (ATM) has been studied in a variety of fields to utilize an air traffic capacity efficiently and solve a congested air traffic situation due to an increment of an air traffic demand. In this paper, an air traffic management, which is related with controlling and determining the sequencing of an aircraft approaching to an airport, in terminal control area is studied. This paper focuses on scheduling algorithms with a given problem for the air traffic management with operational constraints, such as a space separation, an overtaking on the same air-route, and a route merge point (a scheduling point). For a real-time calculation, the presented algorithms focus on dispatching heuristic rules which are able to assign tasks in a fast time period with an adequate performance, which can be demonstrated as a proper and realistic scheduling algorithm. A simulation result is presented to illustrate the validity and applicability of the proposed algorithm. Each scheduling rule is analyzed on the same static and dynamic air traffic flow scenario with the ATM Monte-Carlo simulation.