• 산업경영시스템학회지
• /
• 제6권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.

• 경영정보학연구
• /
• 제9권3호
• /
• pp.45-65
• /
• 2007

경영 환경이 급격하게 변화함에 따라서 전략적 의사결정의 중요성이 커지고 있고, 효과적인 전략적 의사결정 지원 시스템을 개발하기 위해서는 체계적인 전략적 의사결정 프로세스 개발, 효과적인 문제 해결 기법, 편리한 IT 도구가 필요하다. 본 연구에서는 전략적 의사결정 프로세스를 개발하고, 문제해결 기법을 분류하고, 이를 기반으로 기법 추천 시스템을 개발하였다. 이를 기반으로 한 SDSS 프레임웍은 기업의 전략적 의사결정을 지원하기 위한 SDSS 개발에 많은 도움을 줄 것으로 기대된다.

• 대한산업공학회지
• /
• 제24권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년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• 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.

• 복식문화연구
• /
• 제20권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.

• 복식문화연구
• /
• 제2권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.

• 한국인터넷방송통신학회논문지
• /
• 제22권3호
• /
• pp.185-191
• /
• 2022

본 논문은 NP-난제로 다항시간 알고리즘이 알려져 있지 않은 거스름돈 만들기 문제(CMP)에 대해 $O{\frac{n(n+1)}{2}}$ 수행 복잡도의 나눗셈 알고리즘을 제안하였다. CMP는 주어진 돈 C를 c_j,j=1,2,⋯,n의 동전으로 교환할 경우 교환되는 동전 개수 x_j의 합을 최소화 시키는 문제이다. CMP에 대해 알려진 다항시간 알고리즘으로는 욕심쟁이 알고리즘(GA), 분할정복(DC)과 동적 계획법(DP)이 있으나 최적 해는 O(nC)의 DP로 구할 수 있으며, 일반적으로 C>2ⁿ으로 주어진 경우 수행 복잡도는 지수적으로 증가하는 경향이 있어 다항시간 알고리즘이라고 할 수 없다. 본 논문에서는 c_j ≤ C에 한해, j 열에 n개의 c_j 내림차순으로 배치하고, i행에는 c_j의 약수를 모두 제외시킨 k개의 동전을 배치한 k×n 행렬에 대해 상삼각행렬과 주대각선 셀에 대해 나눗셈을 하여 몫(quotient)을 구하는 단순한 알고리즘을 제안한다. 제안된 알고리즘을 다양한 유형의 39개 벤치마킹 실험 데이터에 적용한 결과 최적 해를 단순히 계산기만을 사용하여도 빠르고 정확하게 구할 수 있음을 보였다.

• Management Science and Financial Engineering
• /
• 제9권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.

• 산업경영시스템학회지
• /
• 제45권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.

• 한국인터넷방송통신학회논문지
• /
• 제15권6호
• /
• pp.311-319
• /
• 2015

본 논문에서는 산업공장 내의 생산 효율을 높이기 위하여 제조공정 자원을 예측하고 위험 관리를 효율적으로 이행하는 자원예측 및 위험관리를 위한 의사결정 시스템을 제안하였다. 각 공정에서 발생되는 다양한 정보들을 효율적으로 관리하는 세부 공정별 시나리오 생성이 어렵고, 동일한 공정 내에서도 다양한 제품의 생산하기 위해 제조 설비의 조건 변경이 빈번하다. 제품의 생산 주기 또한 일정하지 않아 연속되지 않은 데이터가 발생하여 소량의 데이터로 변동을 확인해야 하는 문제점이 있다. 이러한 문제점을 해결하기 위해서는 제조공정의 데이터 일원화, 공정 자원 예측, 위험 예측, 공정 현황 모니터링을 통하여 문제 발생시 즉각 조치가 가능하여야 한다. 본 논문에서는 설계도면 변경 범위, 자원 예측, 공정 완료 예정일을 회귀알고리즘을 이용하여 수식을 도출하였으며, 분류 트리 기법, 경계값 분석을 통하여 3단계로 의사결정 시스템을 제안하였다.