• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.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
• /
• v.73 no.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.

• The Korean Journal of Applied Statistics
• /
• v.15 no.2
• /
• pp.323-336
• /
• 2002

In this paper we consider the modified continual reassessment method in which a cohort consists of three patients. Simulation has been a main research tool in the investigation of CRM. In this paper we propose complete enumeration as an alternative of simulation. Using new method we show that the expected toxicity rate at the MTD converges to the target toxicity rate well as the sample size increases.

• Journal of applied mathematics & informatics
• /
• v.9 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.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].

• The Korean Journal of Applied Statistics
• /
• v.16 no.1
• /
• pp.117-128
• /
• 2003

The goal of non-inferiority experiments is to show that the new treatment is not inferior to the standard experiment. In this paper we compare the three methods of variance estimation used in the unconditional exact tests of two proportions. The size and power of the tests with each variance estimation method are compared using complete enumeration.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.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.