• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.13-18
• /
• 1986

This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.22-31
• /
• 2015

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NP-hard problem, three heuristics based on simple rules such as the Johnson's rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.56
• /
• pp.9-18
• /
• 2000

This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1995.10a
• /
• pp.107-113
• /
• 1995

Basement membrane laminin is a multidomain glycoprotein that interacts with itself, heparin and cells. The distal long arm plays major cell and heparin interactive roles. The long arm consists of three subunits (A, B1, B2) joined in a coiled-coil rod attached to a terminal A chain globule (G). The globule is in turn subdivided into five subdomains (Gl-5). In order to analyze the functions of this region, recombinant G domains (rG, rAiG, rG5, rGΔ2980-3028) were expressed in Sf9 insect cells using a baculovirus expression vector. A hybrid molecule (B-rAiG), consisting of recombinant A chain(rAiG) and the authentic B chains (E8-B)was assembled in vitro. The intercalation of rAiG into E8-B chains suppressed a heparin binding activity identified in subdomain Gl-2. By the peptide napping and ligand blotting, the relative affinity of each subeomain to heparin was assigned as Gl> G2= G4> G5> G3, such that G1 bound strongly and G3 not at all. The active heparin binding site of G domain in intact laminin appears to be located in G4 and proximal G5. Cell binding was examined using fibrosarcoma Cells. Cells adhered to E8, B-rAiG, rAiG and rG, did not bind on denatured substrates, poorly bound to the mixture of E8-B and rG. Anti-${\alpha}$6 and anti-${\beta}$1 integrin subunit separately blocked cell adhesion on E8 and B-rAiG, but not on rAiG. Heparin inhibited cell adhesion on rAiG, partially on B-rAiG, and not on E8. In conclusion, 1) There are active and cryptic cell and heparin binding activities in G domain. 2) Triple-helix assembly inactivates cell and heparin binding activities and restores u6131 dependent cell binding activities.

• Structural Engineering and Mechanics
• /
• v.3 no.6
• /
• pp.529-539
• /
• 1995

The rigid-plastic yield-line analysis of isotropically reinforced concrete slabs acting in conjunction with torsionally weak supporting beams is developed as the lower-bound form of a linear programming formulation. The analysis is extended to consider geometric variation of chosen yield-line patterns by the technique of sequential linear programming. A strategy is followed of using a fine potential yield-line mesh to identify possible collapse modes, followed by analysis using a coarser, simplified mesh to refine the investigation and for use in conjunction with geometric optimization of the yield-line system. The method is shown to be effective for the analysis of three slabs of varying complexity. The modes detected by the fine and simplified analyses are not always similar but close agreement in load factors has been consistently obtained.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.389-392
• /
• 2004

The column generation process for the set-partitioning model of the vehicle routing problem requires repeated solutions of column generation subproblems which has a combinatorial structure similar to that of the traveling salesman problem. This limits the size of the problem that can be addressed. We introduce a new modeling approach, termed route-splitting, which splits each vehicle route into segments, and results in more tractable subproblems. A lower bounding scheme that yields an updated bound at each iteration of the column generation process is developed. Implementation issues, including a technique of controlling columns in the master problem, are explored. Lower bounds are computed on standard benchmark problems with up to 199 customers.

• Journal of Microbiology and Biotechnology
• /
• v.23 no.8
• /
• pp.1107-1115
• /
• 2013

The Cyt1Aa protein of Bacillus thuringiensis susbp. israelensis elaborates demonstrable toxicity to mosquito larvae, but more importantly, it enhances the larvicidal activity of this species Cry proteins (Cry11Aa, Cry4Aa, and Cry4Ba) and delays the phenotypic expression of resistance to these that has evolved in Culex quinquefasciatus. It is also known that Cyt1Aa, which is highly lipophilic, synergizes Cry11Aa by functioning as a surrogate membrane-bound receptor for the latter protein. Little is known, however, about whether Cyt1Aa can interact similarly with other Cry proteins not primarily mosquitocidal; for example, Cry2Aa, which is active against lepidopteran larvae, but essentially inactive or has very low toxicity to mosquito larvae. Here we demonstrate by ligand binding and enzyme-linked immunosorbent assays that Cyt1Aa and Cry2Aa form intermolecular complexes in vitro, and in addition show that Cyt1Aa facilitates binding of Cry2Aa throughout the midgut of C. quinquefasciatus larvae. As Cry2Aa and Cry11Aa share structural similarity in domain II, the interaction between Cyt1Aa and Cry2Aa could be a result of a similar mechanism previously proposed for Cry11Aa and Cyt1Aa. Finally, despite the observed interaction between Cry2Aa and Cyt1Aa, only a 2-fold enhancement in toxicity resulted against C. quinquefasciatus. Regardless, our results suggest that Cry2Aa could be a useful component of mosquitocidal endotoxin complements being developed for recombinant strains of B. thuringiensis subsp. israelensis and B. sphaericus aimed at improving the efficacy of commercial products and avoiding resistance.