• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.5
• /
• pp.27-39
• /
• 2019

This study is a case study of KEB HanaBank's information system integration, which has achieved outstanding results based on successful M & A. As of the end of 2018, KEB HanaBank is one of the domestic commercial banks that showed 896 domestic and overseas branches, 12,881 employees, total assets of 326 trillion won, and net income of 1.9 trillion won. The purpose of this study is to provide implications through KEB Hana Bank's unique case and strategy for information system integration since M & A. To accomplish this, KEB HanaBank's information system integration related resource status, strategy, and performance are searched using various sources, and existing researches on resource dependency theory and entrepreneurial bricolage are reviewed. In the post merger integration process, organizations need to understand the status of their resources in terms of resource constraint theory in order to succeed in the information system integration. In resource constraints, for successful computational integration, a strategy based on entrepreneurial bricolage will be needed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.754-757
• /
• 2000

인터넷을 이용한 사이버 거래가 빠른 속도로 증가함으로써 기업에게 있어 인터넷 쇼핑몰 구축은 더 이상 선택사항이 아닌 필수 사항이 되었다. 하지만 현재 사이버 거래 수준은 전통적 상거래 수준에 못 미칠뿐더러 거래 항목에 있어서도 매우 제한적인 것이 사실이다. 앞으로 사이버 거래는 계속적으로 증가하리라 전망되지만 제품의 특성 혹은 고객의 기호에 따라 전통적 상거래도 그 영역을 차지하며 함께 양립하여 발전할 것이다. 이에 본 연구에서는 기존의 상거래 시스템에 사이버 거래기능을 추가하는 모델을 제시한다. 먼저 지리적으로 멀리 떨어져 있는 유통망의 정보화를 위하여 인터넷 기술을 이용하고 공급체인(Supply Chain) 전체에 걸친 동기화를 위해 TOC(Theory of Constraint)의 DBR(Drum-Buffer-Rope) 스케줄링을 응용한다. 모든 생산 및 유통의 흐름 속도가 최종 분배 센타에 접수되는 고객의 요구에 따라 이루어지게 함으로써 공급체인 전체에 걸친 동기화를 이룰 수 있고 지속적인 버퍼 관리를 통하여서 재고의 절감은 물론 미출고의 발생도 최소화할 수 있다. 만약 분배 센타에 재고부족 현상이 일어날 경우에는 공급체인 상의 능력제약자원(Capacity Constraint Resource . CCR)을 찾아 개선 활동을 수행하며 공급체인의 흐름 속도를 능력제약자원에 맞추어 조절한다. 분배 센타에서 대리점 혹은 사이버 고객으로의 배송은 부분적 분할납품 Partial Transshipment : PT) 전략을 적용한다. 즉 각 분배 센타가 관리하는 수요지 중 인접한 지역을 부분적 분할납품 전략 적용 수요지로 선택하고 사이버 거래를 통해 생성된 물류가 부분적 분할납품 전략 적용 수요지에 분배되게 함으로써 각 분배 센타의 재고 완충역할을 수행하게 한다. 이에 따라 안전 재고 및 역 배송을 최소화 할 수 있을 뿐 아니라 미 출고로 인한 손실을 최소화하며 고객의 서비스를 일정하게 유지시킬 수 있을 것으로 기대된다.

• Journal of Ship and Ocean Technology
• /
• v.10 no.2
• /
• pp.37-44
• /
• 2006

The erection in shipbuilding is the process to assemble all the blocks one by one in certain order and requires more leveled and efficient schedule than other processes do. However, erection schedule includes too many constraints to be systemized with simple programs and constraints are changed frequently. These difficulties make it rare to find automatic erection schedule generation system with load leveling ability. In this paper, a CSP (Constraint Satisfaction Problem)-based load leveling algorithm using a maximum load diminution technique is proposed and applied to the block erection scheduling of a dock in a shipyard. The result shows that it performs better than currently used scheduling method based on empirical logics. The maximum load of welding length and crane usage are reduced by 31.63% and 30.00% respectively. The deviation of resource usage amount also decreases by 8.93% and 7.51%.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.1
• /
• pp.105-114
• /
• 2002

Nowadays, most companies seek after the greatest profit by means of offering the goods which consumers want timely and efficiently and minimizing the cost of inventory and distribution channel which amounts to the great portion of total cost. And according as EC(Electronic Commerce) market has increased rapidly, SCM(Supply Chain Management) for EC become one of the most important facts for companies, therefore this paper suggest SCM scheme which EC, especially B to C, is added to the existing commerce system. This paper uses internet for information integration of distribution channel which is away from one another and applies TOC(Theory of Constraint)'s DBR(Drum-Buffer-Rope) Scheduling for synchronization through the whole supply chain. It is possible to synchronize the whole supply chain by means of making the speed of manufacturing and distribution to be controlled by consumer's order which is received in distribution center, and inventory and loss of sales opportunities are minimized by constant. Buffer Management. If inventories in distribution center is short, then it needs to search CCR(Capacity Constraint Resource) in supply chain and to control the speed of manufacturing and distribution according to the ability of CCR. This paper applies PT(Partial Transshipment) strategy for Delivery from distribution center to store or cyber consumer. the strategy this paper suggests chooses neighbour area from area which each distribution center takes charge, and then makes product ordered by cyber consumer which lives in the chosen area to be delivered according to inventory of distribution center.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1435-1440
• /
• 2014

Nodes in WSNs must operate under limited energy resource. Controlling access to the channel in WSNs plays a key role in determining channel utilization and energy consumption. This paper introduces a priority-based time slot allocation protocol for hybrid TDMA/CSMA MAC in WSNs. This protocol combines both TDMA and CSMA techniques while introducing prioritization by (m,k)-firm constraint. The performance of this protocol is obtained through simulations for various number of nodes and show significant improvements in delay and packet delivery ratio compared to S-MAC.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.341-354
• /
• 2005

The adaptation of video according to the heterogeneous and dynamic resource constraints on networks and devices, as well as on user preferences, is a promising approach for universal access and consumption of video content. For optimal adaptation that satisfies the constraints while maximizing the utility that results from the adapted video, it is necessary to devise a systematic way of selecting an appropriate adaptation operation among multiple feasible choices. This paper presents a general conceptual framework that allows the formulation of various adaptations as constrained optimization problems by modeling the relations among feasible adaptation operations, constraints, and utilities. In particular, we present the feasibility of the framework by applying it to a use case of rate adaptation of MPEG-4 video with an explicit modeling of adaptation employing a combination of frame dropping and discrete cosine transform coefficient dropping, constraint, utility, and their mapping relations. Furthermore, we provide a description tool that describes the adaptation-constraint-utility relations as a functional form referred to as a utility function, which has been accepted as a part of the terminal and network quality of service tool in MPEG-21 Digital Item Adaptation (DIA).

• The Korean Journal of Air & Space Law and Policy
• /
• v.21 no.2
• /
• pp.181-205
• /
• 2006

After introduced in 1980's, the Frequent Flyer Program(FFP) was one of the most successful marketing tools in the airline industry and it has become a major linkage pin of strategic alliances for airlines despite of legal constraint. Further, the world air transport market progresses rapidly from a one-to-one alliance to a global alliance among groups due to fierce competition of the markets. In this study, I first examine the trends and the characteristics of global alliance groups. Further, I analyze the types of airline strategic alliances in the FFP, and present management strategy of the FFP for national flag carriers based on the collected data. It is suggested that airlines, including the two major Korean airline companies, consider the advantages of strategic alliances on the FFP in a rapidly changing management environment.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2013.10a
• /
• pp.236-240
• /
• 2013

Due to difficulty of considering dynamic load in side of a computer resource and computing time, it is common that external load is assumed as ideal static load. However, structural analysis under static load cannot guarantee the safety of structural design. Recently, the systematic method to construct equivalent static load from the given dynamic load has been proposed. Previous study has calculated equivalent static load through the optimization procedure under displacement constraints. And previously reported works to distribute equivalent static load were based on ad hoc methods. However, it is appropriate to take into account the stress constraint for the safety design. Moreover, the improper selection of loading position may results in unreliable structural design. The present study proposes the methodology to optimize an equivalent static which distributed on the primary DOFs, DOFs of the constraint elements, DOF of an external load as positions. In conclusion, the reliability of proposed method is demonstrated through a global optimization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.