Systemetic classification of a technology is critical to the development of technology strategy. This paper suggests a new technology classification scheme for computer and communication : a two-level scheme. Technology is first classified by its role and function in the upper level which forms a 2 * 2 matrix. The technology is then further classified into the lower level of 3 classes by associations among technology elements. Thus, a new classification scheme of 2 * 2 * 3 matrix is proposed for the computer and communication technology.

In this study, potential Communication Satellite Application Services (CSASs) that are suitable for our communication environment have been identified through a detailed analysis of the CSASs offered in advanced countries. The existing demand forecast based on the defined CSAS category has been improved, and the transponder assignment policy has also been recommended. Managerial problems rather than technical ones for KOREASAT project have mainly been addressed and tackled in this study. For the successful implementation of the domestic communication satellite system, these two problems should be solved simultaneously. Therefore, future research that includes technical as well as managerial issues is expected to come out soon.

This research analyzes the level of technological growth in Korean telecommunication industry and suggests a technology development strategy. Comparative analysis of technological growth with the advanced countries was performed based on a new technology classification scheme. Technology indices were calculated by applying Analytical Hierarchy Process(AHP). The result of the AHP was put into forecasting models to have a glimse of future growth pattern and to suggest a long-term development strategy for telecommunication technology.

Electronic data interchange (EDI) is a new technology of information communication which can make offices paperless. This study develop an EDI system to communicate informations among companies using computer systems. The system consists of five modules-document I/O, translation, system management, communication, and additional modules. The database of EDI documentation standards has been constructed by the table-driven method. The communication module provides three communication modes-RS232C, MODEM, and message handling system (MHS). The system performance has been improved by the method of data compression and data encryption which prevent the communication delay and illegal users. This EDI system can be used as a front-end, back-end, or stand-alone mode.

The objective of the paper is to develop models for determining the aggregate budget size in long-range R&D planning of KT(Korea Telecom.) and for allocating it by strategically adopted technologies for KT's TOP(Telecommunication-Oriented Paradise) Strategy. In the model of R&D budget size determination, the linear regression analysis is applied. In allocating the R&D expenditure, criteria weighting and technological importance ranking are determined by means of the Analytic Hierarchy Process(AHP) as a decision aid, along with hierarchical representation and pairwse comparisons. R&D budget analysis provides to basic data for the mid-and long-range R&D planning. The model then needs to be adjusted as the TOP project plan becomes specific. Resource allocation model for R&D based on AHP can be used to identify the importance of the technologies for TOP according to short-, mid-, and long-term perspectives without further modification. It is expected that the R&D budget analysis model works as the basis for planning R&D investment strategies and that the resource allocation model for R&D contributes to the effective use of the limited resource.

Modern telecommunication switching systems are SPC(Stored Program Control) machines handling voice, data and other kinds of traffic, in an environment which tends to be fully digital switching and transmission. The throughput of such systems is determined by the real time capacity of its centralized or distributed control processors and by the traffic capacity of the switching network. Designers must verify the traffic and call processing capacity of the switching system and check its performance under traffic load before it is put into service. Verification of traffic and call processing capacity of switching systems is one of the problems treated by teletraffic studies ; teletraffic studies are based on stochastic process, queueing theory, simulations and other quantitative methods of decision making. This study suggests the general methodology to evaluate the throughput and performance of the ISDN switching system. TDX-10 ISDN switching system are employed to give illustrative examples of the methodologies discussed in this study.

The blocking probabilities of nx64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme which searches the different numbers of time slots for different types of calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities, the increased traffic handling capacity and teh reduced CPU processing load, compared with those of the conventional methods.

Various ATM switches have been proposed since Asynchronous Transfer Mode (ATM) was recognized as appropriate for implementing broadband integrated services digital network (BISDN). An ATM switching network may be evaluated on two sides : traffic performances (maximum throughput, delay, and packet loss probability, etc.) and structural features (complexity, i.e. the number of switch elements necessary to construct the same size switching network, maintenance, modularity, and fault tolerance, etc.). ATM switching networks proposed to date tend to show the contrary characteristics between structural features and traffic performance. The Knockout Switch, which is well known as one of ATM switches, shows a good traffic performance but it needs so many switch elements and buffers. In this paper, we propose an input and output buffered Knockout Switch for the purpose of reducing the number of switch elements and buffers of the existing Knockout Switch. We analyze the traffic performance and the structural features of the proposed switching architecture through a discrete time Markov chain and compare with those of the existing Knockout Switch. It was found that the proposed architecture could reduce more than 40 percent of switch elements and more than 30 percent of buffers under a given requirement of cell loss probability of the switch.

This paper describes how Taegu-Prince Hotel develops and operates Hotel Information System. This paper especially explains the organization of Taegu-Prince Hotel, the configurations of hardware and software, and the effects and problems of Hotel Information System.

In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

This paper presents a mathematical model for a class of vertical integration decisions. The problem structure of interest consists of raw material vendors, components suppliers, components processing plants, final product (assembly) plants and external components buyers. Economic feasibility of operating components plants instead of keeping outside suppliers is our major concern. The model also determines assignment of product lines and production volumes to each open plant considering the cost impacts of economies of scale and plant complexity. The problem formulation leads to a concave, mixed integer mathematical program. Given the state of the art of nonlinear programming techniques, it is often not possible to find global optima for reasonably sized such problems. We developed an optimization solution algorithm within the framework of Benders decomposition for the case of a piecewise linear concave cost function. It is shown that our algorithm generates optimal solutions efficiently.

The purpose of this paper is to develop a branch and bound algorithm for the transportation problem with a limited number of company owned vehicles. First, we find an initial solution by solving quasi-assignment subproblem induced by relaxing constraints of the vehicle capacity and illegal tours elimination equations. Second, we build routing from the assignment, and if there is a routings which violates relaxed constraints, we introduce branches of the subproblem in order to remove it. After all branches are searched, we get the optimal solution.