• International Journal of Contents
• /
• v.10 no.4
• /
• pp.30-37
• /
• 2014

The current study was conducted to examine the temporal and spatial activation sequences related to morphosyntactic, semantic and orthographic-lexical sentences, focusing on the morphological-orthographic and lexical-semantic deviation processes in Korean language processing. The Event-related Potentials (ERPs) of 15 healthy students were adopted to explore the processing of head-final critical words in a sentential plausibility task. Specifically, it was examined whether the ERP-pattern to orthographic-lexical violation might show linear precedence over other processes, or the presence of additivity across combined processing components. For the morphosyntactic violation, fronto-central LAN followed by P600 was found, while semantic violation elicited N400, as expected. Activation of P600 was distributed in the left frontal and central sites, while N400 appeared even in frontal sites other than the centro-parietal areas. Most importantly, the orthographic-lexical violation process revealed by earlier N2 with fronto-central activity was shown to be complexes of morphological and semantic functions from the same critical word. The present study suggests that there is a linear precedence over the morphological deviation and its lexical semantic processing based on the immediate possibility of lexical information, followed by sentential semantics. Finally, late syntactic integration processes were completed, showing different topographic activation in order of importance of ongoing sentential information.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.118-118
• /
• 1993

We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

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

The scheduling of parallel computing systems consists of two procedures, the assignment of tasks to each available processor and the ordering of tasks in each processor. The assignment procedure is same with a clustering. The clustering is classified into linear or nonlinear according to the precedence relationship of the tasks in each cluster. The parallel computing system can be modeled with a Directed Acyclic Graph(DAG). By the granularity theory, DAG is categorized into Coarse Grain Type(CDAG) and Fine Grain Type(FDAG). We suggest the linear clustering method for the scheduling of CDAG using the genetic algorithm. The method utilizes a properly that the optimal schedule of a CDAG is one of linear clustering. We present the computational comparisons between the suggested method for CDAG and an existing method for the general DAG including CDAG and FDAG.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.530-539
• /
• 2007

Many construction projects such as highways, pipelines, tunnels, and high-rise buildings typically contain repetitive activities. Research has shown that the Critical Path Method (CPM) is not efficient in scheduling linear construction projects that involve repetitive tasks. Linear Scheduling Method (LSM) is one of the techniques that have been developed since 1960s to handle projects with repetitive characteristics. Although LSM has been regarded as a technique that provides significant advantages over CPM in linear construction projects, it has been mainly viewed as a graphical complement to the CPM. Studies of scheduling linear construction projects with resource consideration are rare, especially with multiple resource constraints. The objective of this proposed research is to explore a resource assignment mechanism, which assigns multiple critical resources to all activities to minimize the project duration while satisfying the activities precedence relationship and resource limitations. Resources assigned to an activity are allowed to vary within a range at different stations, which is a combinatorial optimization problem in nature. A heuristic multiple resource allocation algorithm is explored to obtain a feasible initial solution. The Simulated Annealing search algorithm is then utilized to improve the initial solution for obtaining near-optimum solutions. A housing example is studied to demonstrate the resource assignment mechanism.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.2
• /
• pp.165-171
• /
• 2006

The appearance of over 10,000 TEU containerships (so called Mega-containerships) is determined. In order to operate these ships effectively, the number of these calling ports will diminish, and then feeder ships will transport cargoes from the hub-ports where mega-containerships call to the destination ports. In the hub-ports, handling containers for mega-containerships become huger, thus it is important for terminals to deal with cargo handling as soon as possible. However, the present terminal layout might have the limitation of maximum throughput per time unit. And then the transit time at the ports become longer. Therefore, we investigate the effect on some different terminal layouts with new alternatives. Actually, we discuss the ship-to-berth allocation at some adjacent berths for mega-containerships on three types of terminal layouts. First one is the conventional type consisted by some linear berths, most container terminals in the world are normally this type. Second one is the indented type consisted by linear berths and indented berths which we can handle from both sides of mega-containership simultaneously. Third one is the floating type consisted by linear berths and the floating berth. On this type, mega-containerships can moor between linear and floating berths. The merits of this type are that we can also handle from both sides of mega-containerships simultaneously, and ships can go through between linear berth and floating berths. Thus it is easier for ships to moor and leave berths. Under such assumptions, we examine the numerical experiments. In most cases, the total service times on the indented type are the longest among three types, these on the floating type are the next longer. Those reasons are that these layouts have the differences of berth occupancy obtained by the time and space axes, and whether the precedence constraints of ship service order needs or not.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.23-35
• /
• 2005

This paper aims to develop a practical finite capacity MRP (FCMRP) system based on the needs of an automotive parts manufacturing company in Thailand. The approach includes a linear goal programming model to determine the optimal start time of each operation to minimize the sum of penalty points incurred by exceeding the goals of total earliness, total tardiness, and average flow-time considering the finite capacity of all work centers and precedence of operations. Important factors of the proposed FCMRP system are penalty weights and dispatching rules. Effects of these factors on the performance measures are statistically analyzed based on a real situation of an auto-part factory. Statistical results show that the dispatching rules and penalty weights have significant effects on the performance measures. The proposed FCMRP system offers a good tradeoff between conflicting performance measures and results in the best weighted average performance measures when compared to conventional forward and forward-backward finite capacity scheduling systems.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Journal of Korea Trade
• /
• v.24 no.1
• /
• pp.82-98
• /
• 2020

Purpose - This study aims to overcome the limitations of existing studies, which linearly determine the precedence factors of competency in overseas subsidiaries. The research objectives are as follows. First, what kind of nonlinear effects does the level of control held by Korean headquarters over foreign subsidiaries have in terms of competency in the subsidiaries? Second, what kind of nonlinear effects do the local experiences of overseas subsidiaries have on their competency? Design/methodology - With data on Korean multinational corporations (MNCs), this paper analyzes the effects of control levels of headquarters (HQs) and host-country experiences of foreign subsidiaries regarding competency in overseas subsidiaries. In particular, this study focuses on nonlinear models, differentiating it from previous studies. In order to examine research hypotheses, this study conducted a survey of overseas subsidiaries of Korean corporations. Surveys were conducted through various methods including e-mail, online questionnaires, fax, and telephone calls. Copies of the questionnaire were distributed to a total of 2,246 overseas subsidiaries, and 409 completed responses were collected. Excluding 15 copies that were insufficiently answered, responses from a total of 394 copies were used for analysis. Findings - This study presents the following results. First, there is a U-shaped relationship between levels of HQ control and competency in foreign subsidiaries. This means that higher levels of HQ control negatively impact the competency levels of subsidiaries because strict control undermines autonomy in subsidiaries. However, if the level of HQ control exceeds a certain point, then the transfer of knowledge between HQs and subsidiaries is facilitated. Knowledge transferred from HQs can be used as prior knowledge by foreign subsidiaries to the benefit of all parties. Accordingly, knowledge transfer negates the negative effects of excessive HQ control and positively affects competency in subsidiaries. Second, there is an inverted U-shaped relationship between the local (host-country) experiences of subsidiaries and competency in foreign subsidiaries. This means that foreign subsidiaries can overcome the liabilities of foreignness and contribute to capability building by accumulating unique knowledge about their host countries. However, if local experiences accumulate excessively beyond a certain point, then the host country-specific experiences of foreign subsidiaries will offset the benefits discussed above. Excessive local experiences not only increase organizational inertia, but also create a problem of goal incongruence due to information asymmetry between HQs and subsidiaries. Therefore, excessive local experiences have negative effects on competency in foreign subsidiaries. Originality/value - This study suggests the following implications. First, unlike existing studies based mainly on linear models, this study presents important theoretical implications in its focus on nonlinear models and its analysis of the effects of HQ control and local experiences on competency in foreign subsidiaries from perspectives of organizational learning theory and agency theory. Second, in terms of practical implications, the results of this study suggest that optimally raising levels of HQ control and managing the local experiences of subsidiaries without increasing organizational inertia is important for enhancing competency in foreign subsidiaries.