• 한국경영과학회지
• /
• 제22권4호
• /
• pp.167-172
• /
• 1997

We present a procedure which finds the probability distribution of number of customers accumulated when the server ends a vacation in the Geo/G/1 gated queueing system, where the service for a customer and the vacation, respectively, takes one slot time. The pp. g. f. for the number of customers accumulated at the gate closing epoch is obtained as a recursive form. The full probabilities, then, are derived using an iterative procedure. This system finds an application in a packet transmitting telecommunications system where the server transmits(serves) packets(customers) accumulated at a gate closing epoch, and takes one slot time vacation thereafter.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.530-533
• /
• 1996

This paper deals with finding an initial solution and modifying search direction by the centrering force in the predictor-corrector method which is a variant of the primal-dual barrier method. These methods were tested with NETLIB problems. Initial solutions which are located close to the center of the feasible set lower the number of iterations, as they enlarge the step length. Three heuristic methods to find such initial solution are suggested. The new methods reduce the average number of iterations by 52% to at most, compared with the old method assigning 1 to initial valurs. Solutions can move closer to the central path fast by enlarging the centering force in early steps. It enlarge the step length, so reduces the number of iterations. The more effective this method is the closer the initial solution is to the boundary of the feasible set.

• 한국경영과학회지
• /
• 제16권1호
• /
• pp.1-12
• /
• 1991

This paper studies an optimal algorithm for the Maximum Origin-Destination Flor Path (MODFP) in an acyclic transportation network. We define a Pseudo-Flow each are so that it can give an upper bound to the total flow of a given path. And using the K-th Shortest Path algorithm we obtain upper bound of MODF which is decreasing as the number of searched path grows. Computational Complexity of optimal algorithm is O(K + m) $n_{2}$), K being the total number of searched path. We proved that the problem complexity of finding MODFP in an acyclic network is NP-hard, showing that the-satisfiability problem can be polynomialy reduced to this problem. And we estimated the average of the number K as being (m/n)$^{1,08}$ Exp (0.00689gm) from the computational experiments.

• 한국국방경영분석학회지
• /
• 제27권2호
• /
• pp.25-36
• /
• 2001

In this paper a new heuristic algorithm has been developed and presented for logistics for multiple objectives in an automated manufacturing systems. We proposed Simallest Processing and Average setup time Ratio First(SPARF) algorithm for multiple criteria under sequence setup time. The heuristic algorithm is implemented on the various problem cases by number of jobs and machines. The proposed algorithm provided smaller than the previously documented heuristics. The results obtained show a superior solution by the new heuristic over previous heuristics on all problem sizes. we perform analyses of variance to fortify the above results of comparison with the previous algorithms to the four cases using Statistical Analysis System(SAS) package. The results show that the larger is the number of groups or cells, the bigger is the amount of improvement by the proposed algorithms. It suggests that the algorithms proposed is strongly influenced by the number of cells, groups and interaction of these factors.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.234-241
• /
• 1996

Trip-based material handling systems such as AGV systems, lift trucks, etc. are often designed with a given flow matrix (or FROM-TO chart) which is usually treated as the number of loaded trips that the devices must perform per unit time between the stations. In reality, the number of trips that would result from parts flow in a facility is dictated by the transfer batch size, i.e., the number of parts that are transferred from one station to the next in one trip. In this paper, we present analytical and simulation results aimed at determining optimal or near-optimal transfer batch sizes in manufacturing systems.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.63-68
• /
• 1983

The ideal way of eliminating errors in a large scale software system is to test the software with all possible inputs, providing sufficiently large amount of execution time. However, in practice, the test must be performed within given budget and time limits. Therefore, to perform the test under given constraints, we have to properly select inputs and determine the execution time for each selected inputs. This paper studies the distribution of number of errors at a given time as well as the distribution of time required to reduce the number of errors to a certain level. We assumed that error occurrence times are distributed exponentially (not necessarily identical) and the number of errors at the initial stage is known or estimable.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.845-850
• /
• 2002

In this study we consider a flow-line CONWIP System with Compound Poisson Demands. The processing times of each workstation follow a Coxian-2 distribution. The demands that are not satisfied instantaneously are either backordered or lost according to the number of backordered demands that exist at their arrival instants. For this system we develop an approxi­mation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the average number of backordered demands and the proportion of the lost demands. Comparisons with simulation have shown that the approximate method provides fairly good results.

• 대한수학교육학회지:수학교육학연구
• /
• 제21권3호
• /
• pp.239-259
• /
• 2011

본 연구는 초등학생들의 일반화된 산술로서의 대수적 추론 능력의 실태를 알아보고자, 연산의 성질 이해 과제로 구성된 검사 도구를 이용하여 2학년 648명, 4학년 688명, 6학년 751명의 반응을 분석하였다. 분석 결과, 상당수의 학생들이 문제 상황에 포함된 연산의 성질을 제대로 파악하지 못하였고, 연산의 성질을 적용하여 문제를 해결하는 데 많은 어려움을 겪는 것으로 드러났다. 연산의 성질별로는 교환법칙 과제에서는 저학년에서부터 높은 성공률을 보인 반면, 결합법칙과 분배법칙에서는 고학년에서도 매우 낮은 성공률을 보였다. 문제 상황별로는 특히, 결합법칙 및 분배법칙 과제의 경우 구체적인 수 상황에서의 성공률이 임의의 수 상황에서의 성공률에 비해 상대적으로 더 낮게 나타났다. 이러한 결과들을 토대로 본 논문은 초등학교에서의 대수 지도 방안에 대한 시사점을 제공하였다.

• 한국경영과학회지
• /
• 제29권1호
• /
• pp.43-56
• /
• 2004

The purpose of clustering is to partition a set of objects into several clusters based on some appropriate similarity measure. In most cases, clustering is considered without any prior information on the number of clusters or the structure of the given data, which makes clustering is one example of very complicated combinatorial optimization problems. In this paper we propose a general-purpose clustering method that can determine the proper number of clusters as well as efficiently carry out clustering analysis for various types of data. The method is composed of two stages. In the first stage, two different hierarchical clustering methods are used to get a reasonably good clustering result, which is improved In the second stage by ASA(accelerated simulated annealing) algorithm equipped with specially designed perturbation schemes. Extensive experimental results are given to demonstrate the apparent usefulness of our ASA clustering method.