• Journal of Korea Society of Industrial Information Systems
• /
• v.1 no.1
• /
• pp.29-62
• /
• 1996

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.102-107
• /
• 2002

The theoretical performance of MMSE linear microdiversity combining in Rayleigh fading, additive interference channels has already been derived exactly in the literature. In the macrodiversity case the fundamental difference is that any given source may well have different average received powers at the different antennas. This makes an exact analysis more difficult and hence for the macrodiversity case we derive a bound on the mean BER and a semi-analytic upper bound on outage probabilities. Hence we provide bounds on the performance of MMSE linear microdiversity combining in Rayleigh fading with additive noise and any number of interferers with arbitrary powers.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.620-625
• /
• 2008

The $H_{\infty}$ entropy in $H_{\infty}$ control theory is discussed based on investigating information transmission in continuous-time linear stochastic systems. It is proved that the stabilizing feedback does not change the time-average information transmission between system input and output, and the $H_{\infty}$ entropies of open- and closed-loop stable transfer functions are bounded by mutual information rate between input and output in the open-loop system. Furthermore, a new $H_2$ upper bound for $H_{\infty}$ entropy is introduced with a numerical example. Thus the $H_{\infty}$ entropy of a stable transfer function is sandwiched between $H_2$ norms of the original system and a static feedback system.

• Advances in Computational Design
• /
• v.1 no.2
• /
• pp.119-138
• /
• 2016

In this article, hybridization of enhanced colliding bodies optimization (ECBO) with upper bound strategy (UBS) that is called UECBO is proposed for optimum design of truss structures with frequency constraints. The distinct feature of the proposed algorithm is that it requires less computational time while preserving the good accuracy of the ECBO. Four truss structures with frequency limitations selected from the literature are studied to verify the viability of the algorithm. This type of problems is highly non-linear and non-convex. The numerical results show the successful performance of the UECBO algorithm in comparison to the CBO, ECBO and some other metaheuristic optimization methods.

• Macromolecular Research
• /
• v.8 no.6
• /
• pp.285-291
• /
• 2000

Influence of silane coupling agent, bis-(3-(triethoxisilyl)-propyl)-tetrassulfide, on cure characteristics and bound rubber content of filled styrene-butadiene rubber (SBR) compounds and on physical properties of the vulcanizates was studied. Carbon black-filled and silica-filled compounds were compared. Content of the bound rubber increased with increased content of the silane coupling agent and this trend was shown more clearly in the silica-filled compounds. Optimum cure time of the carbon black-filled compound increased with increase of the silane content, while that of the silica-filled one decreased. Cure rate of the carbon black-filled compound became slower as the silane content increased while that of the silica-filled one became faster. By increasing the silane content, the minimum torque decreased and the delta torque increased. Physical properties of the silica-filled vulcanizate were found to be improved by adding the silane coupling agent. However, for the carbon black-filled vulcanizates, the tensile strength and tear resistance decreased with increase of the silane content. The differences between the carbon black-filled and silica-filled compounds were explained by difference in the reactivities of the fillers with the silane.

• Journal of Microbiology
• /
• v.35 no.1
• /
• pp.47-52
• /
• 1997

To examine whether the xylene component of BTX (benzene, toluene, xylene) mixture is cometabolized and residues are produced in soil, $\^$14/C-labeled-0-xylene was added to sandy loam in combination with unlabeled benzene and toluene. After 4 weeks of incubation in a sealed system connected to an oxygen reservoir, 55.1% of the radiocarbon was converted to $\^$14/CO$\sub$2/, 3.0% was to 95.8% radiocarbon recovery. Biomass incorporation of o-xylene radiocarbon which was detected by fumigation/extraction was usually low (5.6%), but 32.1% radiocarbon became associated with soil humus. Most of the numus-bound radiocarbon was found in humin fraction. In addition to o-xylene, p-xylene and toluene also showed similar results. The evidence shows that some of their reactive methylcatechol biodegradation intermediates attach to the humic metrix in soil in preference to mineralization and biomass incorporation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.9 no.2
• /
• pp.23-27
• /
• 1984

We Observe a sequence of i. i. d random variables with density f or g. Only if g is true we should stop the process. Hence. the testing problem is completely described by a stopping time. Among all stopping times with error probability of first kind not exceeding a given bound, the one-sided sequential probability ratio test has smallest expected sample size if g is true. Moreover, the generalized one-sided SPRT has smallest expected sample size for g in the class of stopping times with expected sample size under f not falling below a given bound.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.3
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.33-46
• /
• 2000

The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.