• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.9
• /
• pp.111-124
• /
• 1983

The basic model of decision problem the enterprise is conforonted with includes the following 3 elements ; 1) Elements that can not be controlled by the decision maker : In the thesis elements are named environmental variables, and varied itself according to the change of environmental condition. 2) Elements that can be controlled by the decision maker ; These elements are called decision elements in the thesis and variable according to the event. 3) object of decision making : The degree of achievement to the object is identified by taking various criteria- The index indicating the degree of achievement to the object whatever criterion is applied is called object function in the thesis. It's the fanetion of environmental variable, decision variable and object function. The relation between them brings forth the relation formula that characterize the each problem. The basic types of decision making model use in the thesis are as following ; 1) The problem of decision making under conditions of certainty. 2) The problem of decision making under conditions of risk. 3) The problem of decision making under conditions of uncertainty. 4) The problem of decision making under competitive condition. in general case that the Profit of two decision makers varies, what we regard the decision that make the sum of profit of two men maximum as the best choice for two men has a reasonability in certain case. When the sum of profit two men is zero, by taking toe promise that ail of them art according to the min-max criteria and by extending the object of choice to the mixed strategy. We certify the existance of equilibrium solution and admit them as the best solution of competitive model in general.

• Information Systems Review
• /
• v.9 no.3
• /
• pp.45-65
• /
• 2007

As digital economy era and knowledge society advent, division of the industry has been indistinctive and complex. This change of business environment has leaded todifficulty in operations of firms consisted of continuous decision making. To develop effective SDSS needs systematic strategic decision making process, efficient problem solving techniques, information of good quality, efficiently information system, and analysis ability of problem solver. This research develop SDSS framework combined strategic decision making process with various problem solving techniques for designing SDSS. Finally, this paper developed the technique recommendation system by selected the criterions of technique assortment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.649-660
• /
• 1998

Steel making in Mini Mill consists of three major processing stages: molten steel making in an electric arc fuenace, slab casting in a continuous caster, and hot rolling in a finishing mill. Each processing stage has its own lot grouping criterion. However, these criteria in three stages are conflicting with each other. Therefore, delveloping on efficient lot grouping algorithm to enhance the overall productivity of the Mini Mill is an extremely difficult task. The algorithm proposed in this paper is divided into three steps hierarchically: change grouping, cast grouping, and roll grouping. An efficient charge grouping heuristic is developed by exploiting the characteristics of the orders, the processing constraints and the requirements for the downstream stages. In order to maximaize the productivity of the continuous casters, each cast must contain as many charges as possible. Based on the constraint satisfaction problem technique, an efficient cast grouping heuristic is developed. Each roll consists of two casts satisfying the constraints for rolling. The roll grouping problem is formulated as a weighted non-bipartite matching problem, and an optimal roll grouping algorithm is developed. The proposed algorithm is programmed with C language and tested on a SUN Workstation with real data obtained from the H steel works. Through the computational experiment, the algorithm is verified to yield quite satisfactory solutions within a few minutes.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1161-1164
• /
• 1996

In this paper, a parameter optimization technique for a mobile robot navigation is discussed. Authors already have proposed a navigation algorithm for mobile robots with sonar sensors using fuzzy decision making theory. Fuzzy decision making selects the optimal via-point utilizing membership values of each via-point candidate for fuzzy navigation goals. However, to make a robot successfully navigate through an unknown and cluttered environment, one needs to adjust parameters of membership function, thus changing shape of MF, for each fuzzy goal. Furthermore, the change in robot configuration, like change in sensor arrangement or sensing range, invokes another adjusting of MFs. To accomplish an intelligent way to adjust these parameters, we adopted a genetic algorithm, which does not require any formulation of the problem, thus more appropriate for robot navigation. Genetic algorithm generates the fittest parameter set through crossover and mutation operation of its string representation. The fitness of a parameter set is assigned after a simulation run according to its time of travel, accumulated heading angle change and collision. A series of simulations for several different environments is carried out to verify the proposed method. The results show the optimal parameters can be acquired with this method.

• The Research Journal of the Costume Culture
• /
• v.20 no.4
• /
• pp.594-603
• /
• 2012

This study aimed to investigate a bias pattern making method with geometrical approach. The bias-cut dress has soft silhouette of drape in the garment. However, the bias cut dress has problem of satisfying the intended garment size spec. This problem occurs from various sources. The main reason is that the bias-cut fabric tends to stretch on longitudinal direction and to shrink horizontal direction when it was hung on the body. The goal of this study was to develop a bias-cut dress pattern making method satisfying the intended garment size spec. The researchers developed the geometrical method of measuring dimensional change by calculating the compensation ratio of the fabric in true bias direction. The compensation ratio was calculated by applying draping ratio of the fabric. Three types of fabrics were used in the experiment. The warp and weft crossing angle of fabric was ranged from $78^{\circ}$ to $82^{\circ}$. The fabrics stretched longitudinally 6.9~9.9% and shrank horizontally 7.2~11.0%. The compensation ratio of the bias-cut pattern for sample dress was calculated for each fabric type. Two types of experimental bias-cut dress patterns were developed for each fabric. One pattern was made with applying full compensation ratio and the other one made with applying partial ratio of the fabric. Experimental dresses were made with these patterns. The results of the evaluation showed that the bias-cut dress pattern applying the partial compensation ratio was more appropriate than the pattern applying the full compensation ratio.

• The Research Journal of the Costume Culture
• /
• v.2 no.1
• /
• pp.93-104
• /
• 1994

Nowadays computer technology is being applied in various areas of apparel design. In particular, since the task of pattern making is to be performed by a set of predefined drawing rules, the effect of computer application in pattern making will be significant, There have been a large number of studies on pattern making program. For instance, the previous studies have developed computer programs for pattern making of women's wear, men's wear, children's wear, Han-Bok, etc. Most of them have focused on the development of computer program for a particular kind of apparel only and, however, have disregarded the feasibility of developing a multi-purposed computer program so that is just can be modified to adopt for various styles. For example, by widening the hem-wide of the basic H-Line skirt and then connecting its waist line and widened hem-wide, we can draw the A-Line skirt. Therefore, we have developed a program which can make a pattern for the basic skirt and can mae, with a slight change of he program, other patterns for various style as well. The objective of this paper is to identify and organize modules which will be used for developing a general pattern making computer system. This general pattern making system is a computer program by which we can draw a variety of apparel styles. This system is restricted to skirt pattern making only. there presentation scheme used in organizing these modules is an AND-OR tree, the one being often used in representing a complex problem in artificial intelligence domain.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.21-45
• /
• 2003

Various organizational factors effect successful implementation of IT enabled business transformation. Among them, the most critical success factor is deemed to overcoming change management problem. Lots of studies have been made on implementation methodologies and business process formalizations to encourage organizational members to accept new business process changes. However, the logic of process redesign still depends on qualitative problem solving techniques mostly depending on basically human intuition such as brainstorming, cause-and-effect analysis, and so on. In this paper, we develop algorithmic procedure applicable to designing various business process changes such as process automation, business process resequencing, and more radical process integration. The framework is employed from dynamic programming approach in the literature, which is based on the decision making paradigm of organizations to abstract business processes as quantitative decision models. As such, our research can fill the gap of limited development of theory based analytic methodologies for business process design, by providing objective rationale to reach the consensus among the organizational members including senior management.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.174-179
• /
• 2022

Companies are making design changes by improving product quality and function to succeed while meeting customer requirements continuously. Design changes are changing the product BOM's amount, item, specification, and shape while causing a change in the product's structure. At this time, the problem of inventory exhaustion of parts before design change is a big topic. If the inventory exhaustion fails, the pieces before the design change become unused and are discarded, resulting in a decrease in asset value, and the quality cost of the design change affects the company's profits. Therefore, it is necessary to decide to minimize quality costs while minimizing waste inventory costs at the time of application of design changes. According to the analysis, priorities should be prioritized according to urgency because the quantity of items before the design change affects the applied lead time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.311-319
• /
• 2015

In this paper, in order to increase the production efficiency of the industrial plant, and predicts the resources of the manufacturing process, we have proposed a decision-making system for resource implementing the risk management effectively forecasting and risk management. A variety of information that occurs at each step efficiently difficult the creation of detailed process steps in the scenario you want to manage, is a frequent condition change of manufacturing facilities for the production of various products even within the same process. The data that is not contiguous products production cycle also not constant occurs, there is a problem that needs to check the variation in the small amount of data. In order to solve these problems, data centralized manufacturing processes, process resource prediction, risk prediction, through a process current status monitoring, must allow action immediately when a problem occurs. In this paper, the range of change in the design drawing, resource prediction, a process completion date using a regression algorithm to derive the formula, classification tree technique was proposed decision system in three stages through the boundary value analysis.