• 산업경영시스템학회지
• /
• 제15권25호
• /
• pp.91-95
• /
• 1992

The aircraft schedule is the central of an airline's planning process, aimed at optimizing the deployment of airline's resources in order to maximize profits In this paper, the aircraft schedule is formulated as an integer programming model and the exact algorithm hared on enumeration method is proposed.

• Journal of the Korean Physical Society
• /
• 제73권12호
• /
• pp.1808-1813
• /
• 2018

I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

• 응용통계연구
• /
• 제15권2호
• /
• pp.323-336
• /
• 2002

최근에 1상 임상실험 에서 사용되는 continual reassessment method (CRM)에 대한 연구가 활발히 이루어지고 있다. 본 논문에서는 세 명의 환자를 하나의 환자 군으로 삼아 동일한 용량을 투여하는 수정된 CRM에 대한 연구를 실행하였다. 지금까지 CRM에 대한연구는 대부분 시뮬레이션에 의존하여 왔지만, 본 논문에서는 모든 가능한 경우를 고려하는 방법(complete enumeration)을 사용하였다. 이 새로운 방법은 시뮬레이션을 대체할 유용한 방법이라 사료된다. 이 새로운 방법을 이용하여, 용량독성곡선이 logistic함수, hyperbolic tangent 함수, power 함수일 때, 수정된 CRM에서 결정한 최대허용용량에서의 독성 확률이 목표 독성 확률로 잘 수렴함을 보였다. 하지만, 실험 전에 용량들을 적절히 선택하지 못하면, 최대허용용량에서의 독성 확률이 목표 독성 확률과 상당한 차이를 낼 수도 있음을 발견하였다.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.621-633
• /
• 2002

This paper provides some functional equations and parametric expressions of f-essential maps on the projective plane, on the torus and on the Klein bottle with the size as a parameter and gives their explicit formulae for exact enumeration further.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.190-196
• /
• 2004

In this paper, we address a layout design problem, PTL[3], for determining an optimal 3-class-based dedicated linear storage layout in a class of unit load storage systems. Our objective is to minimize the expected single command travel time. We analyze PTL[3] to derive a fundamental property that an optimal solution to PTL[3] is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. Using the property and partial enumeration, we construct an efficient exact algorithm with O $(n\;{\lceil}\;log\;n\;{\rceil}\;)$ for solving PTL[3].

• 응용통계연구
• /
• 제16권1호
• /
• pp.117-128
• /
• 2003

새로운 약의 치료 효과가 기존의 약의 치료 효과보다 못하지 않음을 보이는 것이 목적인 실험을 noninferiority 실험이라고 한다. 본 논문에서는 이표본에서 모비율의 noninferiority 실험에서 무조건부 정확검정에 사용되는 세 가지 분산 추정방법을 비교하였다. 가능한 모든 경우를 조사하는 방법을 이용하여 세 가지 분산 추정방법에 따라 소표본에서 크기와 검정력을 비교하였다

• 대한산업공학회지
• /
• 제24권3호
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.