• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.10a
• /
• pp.35-35
• /
• 1994

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1231-1234
• /
• 1998

Many signal processing methods of widening the sound image for spatial impression have been studied. Most typical methods of widening the sound image are related to the phase shifting and precedence effect. However, these methods are not effective in center sound image. As listener's position moves from center to outside, the center sound image is shifted to the speaker. That is to say, the directional localization of center sound image is unstable. In this paper, we propose a television audio system including center speaker, and analyze the role of center speaker using theory of Makida and precedence effect. In experiments, we confirm the usefulness of the center speaker for the stability of center sound image.

• Language and Information
• /
• v.4 no.2
• /
• pp.93-105
• /
• 2000

I argue in this paper that the sequence of tense (SOT) phenomenon can be accounted for without positing a SOT rule, focusing on the contrast between the past under-past sentences which lead to ambiguity and those sentences which do not. The different interpreta- tion of past under past sentences depends on whether the stative or then non-stative predicates occur in the complement clauses in the propositional attitude verbs. Based on this, I also argue that the embedded past tense does not contribute to the seman- tics past tense in the complement clause. Instead, it is due to the occurrence of the stative or non-stative predicates in the complement clauses. The stative predicates are associated with the temporal precedence or the overlap relation, whereas the non-stative predicates the precedence relation only. This fact triggers the contrast in past- under- past sentences.(Korea University)

• Management Science and Financial Engineering
• /
• v.7 no.2
• /
• pp.1-11
• /
• 2001

Gouveia and Pires (European Journal of Operations Research 112(1999) 134-146) have proposed four extended formulations having precedence variables as extra variables and characterized the projections of three of the four formulations into the natural variable space. In Gouveia and Pires (Discrete Applied Mathematics 112 (2001)), they also have introduced some other extended formulations with the same extra variables and conjectured that the projection of one of the proposed formulations is equivalent to the one proposed by Dantzig, Fulkerson, and Johnson (Operations Research 2(1954) 393-410). In this paper, we provide a unifying framework based on which we give alternative proofs on the projections of three extended formulations and new proofs on those of two formulations appeared in Gouveia and Pires(1999, 2001).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.350-353
• /
• 2003

Navy surface vessels require pier services such as emergency repair, oil supply, fm loading/unloading, crane, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. The study suggests Mixed Integer Programing (MIP) model for bath allocation problem, considering precedence relationships among services. For a effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG Cplex 7.0. The results of the model show reduction of berth shifts and increasement of service benefits. And thus, it would be a possibility of contribution in the improvement of fleet readiness.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.396-404
• /
• 2012

This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique presented in this paper, we exploit the precedence relations between subtasks in an accurate way while taking advantage of the deadline of different subtasks. Another nice feature of our approach is that it avoids calculation time overhead by exploiting the concept of deadline busy period. Experimental results show that this consideration leads to a significant improvement compared with existing work.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.135-144
• /
• 1999

A major concern in Concurrent Engineering is the control and management of workload in a period of process. As a general rule, leveling the peak of workload in a certain period is difficult because concurrent processing is comprised of various processes, including overlapping, paralleling and looping. Therefore, workload management with resource constraints is so beneficial that effective methods to analyze design process This study presents a procedure to transform the IDEF3 process model into the precedence logic network model for more useful assessment of the process. This approach is expected to facilitate resolving resource constrained scheduling problems more systematically in Concurrent Engineering environment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.7 no.3 s.18
• /
• pp.77-83
• /
• 2004

This paper focuses on a scheduling problem of military training. Repetitive and identical training over multiple serials is a common type of military education. A simple but systematic method is suggested to determine a training schedule for small groups divided from each serial. A satisfactory training schedule and the number of such small groups can be determined by iteratively solving assignment problems with additional constraints. With this method, loads of instructors can also be balanced without violating constraints associated with precedence and continuity relationships among lectures.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.171-192
• /
• 1993

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.