• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.154-161
• /
• 2010

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.578-586
• /
• 2005

In this Paper we consider the problem of sequence alignment with quality scores. DNA sequences produced by a base-calling program (as part of sequencing) have quality scores which represent the confidence level for individual bases. However, previous sequence alignment algorithms do not consider such quality scores. To solve sequence alignment with quality scores, we propose a measure of an alignment of two sequences with orality scores. We show that an optimal alignment in this measure can be found by dynamic programming.

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.1
• /
• pp.23-31
• /
• 1983

A group scheduling problem, which is production scheduling problem associated with the concept of group technology, is studied under due date constraints in multi-stage manufacturing systems. The purpose of this paper is to develop and evaluate a practical heuristic procedure for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems. A heuristic algorithm has been developed by introducing the concept of relative measures of job tardiness and group tardiness for job sequencing and group sequencing, respectively. A numerical example is shown to illustrate the proposed procedure. The heuristic algoirthm is tested by comparisons with problems with known optimal solutions and also with random group schedules for a set of large-size problems. Results indicate that the proposed heuristic algorithm provides good solutions with small computational requirements, and thus is viable for large size problems in practice.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.31-38
• /
• 1994

We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.

• 한국생물공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.343-346
• /
• 2005

The isolated strain, SC2-1 was Gram-positive, catalase positive, facultatively anaerobic, oxidase negative, motile and small rods. The strain utilized sucrose, dextrose, fructose, mannitol and maltose as a sole carbon and energy source and sodium chloride required for the bacteria growth. The radical scavenging activity of the culture supernatants was determined by DPPH (1,1-diphenyl-2-picrylhydrazyl) method. This bacterium was identified based on cellular fatty acids analysis and 16S rDNA sequencing then named Exiguobacterium sp. SC2-1. The optimum culture conditions for production of antioxidant were $25^{\circ}C,$ pH 7.8 and NaCl concentration were 4%. The modified optimal medium compositions were maltose 2.5% (w/v), yeast extract 1.5% (w/v) and $KH_2PO_4$ 0.05% (w/v). Free radical scavenging activity of under optimal culture conditions were 93%.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.145-153
• /
• 1999

We consider a Direct Input Output Manufacturing System(DIOMS) which has a munber of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the machine centers located at either one or both sides of the As/Rs. This report studies the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the S/R machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this report, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.

• Pediatric Gastroenterology, Hepatology & Nutrition
• /
• v.20 no.2
• /
• pp.114-123
• /
• 2017

Purpose: The goal of this study was the early diagnosis of ABCB11 spectrum liver disorders, especially those focused on benign recurrent intrahepatic cholestasis and progressive familial intrahepatic cholestasis. Methods: Fifty patients presenting neonatal cholestasis were evaluated to identify underlying etiologies. Genetic analysis was performed on patients suspected to have syndromic diseases or ABCB11 spectrum liver disorders. Two families with proven ABCB11 spectrum liver disorders were subjected to genetic analyses to confirm the diagnosis and were provided genetic counseling. Whole exome sequencing and Sanger sequencing were performed on the patients and the family members. Results: Idiopathic or viral hepatitis was diagnosed in 34%, metabolic disease in 20%, total parenteral nutrition induced cholestasis in 16%, extrahepatic biliary atresia in 14%, genetic disease in 10%, neonatal lupus in 2%, congenital syphilis in 2%, and choledochal cyst in 2% of the patients. The patient with progressive familial intrahepatic cholestasis had novel heterozygous mutations of ABCB11 c.11C>G (p.Ser4*) and c.1543A>G (p.Asn515Asp). The patient with benign recurrent intrahepatic cholestasis had homozygous mutations of ABCB11 c.1331T>C (p.Val444Ala) and heterozygous, c.3084A>G (p.Ala1028Ala). Genetic confirmation of ABCB11 spectrum liver disorder led to early liver transplantation in the progressive familial intrahepatic cholestasis patient. In addition, the atypically severe benign recurrent intrahepatic cholestasis patient was able to avoid unnecessary liver transplantation after genetic analysis. Conclusion: ABCB11 spectrum liver disorders can be clinically indistinguishable as they share similar characteristics related to acute episodes. A comprehensive genetic analysis will facilitate optimal diagnosis and treatment.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.65 no.4
• /
• pp.274-283
• /
• 2020

Seed dormancy is an adaptive trait in which seeds do not germinate under unfavorable environmental conditions. Low dormancy seeds are easily germinated under optimal environmental conditions, and these characteristics greatly reduce the yield and quality of crops. In the present study, we compared the pre-harvest sprouting (PHS) rate of two cultivars, Joun and Jopyeong, using the Winkler scale after heading day and temperature of the test. The PHS rate increased as the Winkler scale after heading day increased from 700℃ to 1100℃ and the temperature of the test increased. In all conditions, the PHS rate of Jopyeong was higher than that of Joun. RNA-sequencing was used to analyze the cause of the high PHS rate. We analyzed the biological metabolic processes related to the abscisic acid (ABA) metabolite pathway using the KEGG mapper with selected differentially expressed genes in PHS seeds. We found that the expression of ABA biosynthesis genes (OsNCEDs) was down-regulated and that ABA catabolic genes (OsCYP707As) was up-regulated in PHS seeds. However, the quantitative real-time PCR results showed that Joun had a higher expression of OsNCEDs than that of Jopyeong, but OsCYP707As did not yield a significant result. Joun displayed higher ABA content than that of Jopyeong not only during ripeness time but also during PHS treatment. Taken together, we provided evidence that the ABA content remaining in the seed is important to the PHS rate, which is determined by the expression level of the ABA biosynthesis gene OsNCEDs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.11-23
• /
• 1993

A basic problem of sequencing a set of independent tasks at a single facility with the objective of minimizing total tardiness is considered. A variation of beam search, called knowledge-based beam search, has been studied which uses domain knowledge to reduce the problem size with an evaluation function to generate nodes probable to include the optimal solution. Its performance behavior is compared with some existing algorithms.