• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.8 no.1
• /
• pp.19-26
• /
• 1983

This paper deals with the problem of locating facilities with upper and lower capacity bounds in a single level physical distribution system at minimum total costs. Several known schemes for location problems with upper capacity bounds only are successfully extended to our case and then implemented into our branch ana bound solution procedure. Computational experiments with twelve test problems suggest the effectiveness of our approach by showing that only a small amount of additional computation is required for our problem as compared to that for the problems with upper capacity bounds.

• Korean Management Science Review
• /
• v.7 no.2
• /
• pp.51-57
• /
• 1990

The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.13-22
• /
• 1997

In this paper, we supposed allocating the number of redundancies as the model of 0-1 knapsack problem and formulated the problem to maximize the systems reliability for a mission length. The formulated problem reduced the problem size using the modified branch and bound algorithm by Lagrangian relaxation. The subgradient method can optimize the set of solution. To verify the proposed method, we presented the improved resutls of the systems composed of two and ten component groups as the commparison of those in other papers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.3
• /
• pp.1-9
• /
• 2003

Databases are central to business information systems and RDBMS is most widely used for the database system. Normalization was designed to control various anomalies (insert, update, delete anomalies). However, normalized database design does not account for the tradeoffs necessary for performance. In this research, I model a database design method considering denormalization of duplicating attributes in order to reduce frequent join processes. This model considers response time for processing each select, insert, update, delete transaction, and for treating anomalies. A branch and bound method is proposed for this model.

• Korean Journal of Mathematics
• /
• v.30 no.1
• /
• pp.73-80
• /
• 2022

In this article, we represent and examine a new subclass of holomorphic and bi-univalent functions defined in the open unit disk 𝖀, which is associated with the Dziok-Srivastava operator. Additionally, we get upper bound estimates on the Taylor-Maclaurin coefficients |a₂| and |a₃| of functions in the new class and improve some recent studies.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1997.10a
• /
• pp.278-283
• /
• 1997

This paper proposes a systematic design method for axial(or thrust) magnetic bearings using optimal design methodology. The objective of the optimal design is to minimize bearing volume. The constraints include the bearing load capacity, linearized bearing stiffness and damping, the magnetic flux density, and geometric relations. In order to obtain design values which can be applied to fabrication of bearings, branch and bound method was introduced in the postprocessing procedure of optimal design results. Verification of the proposed design methodology was perfomed by an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1123-1128
• /
• 1993

In this paper, utilizing the line balancing algorithm proposed to deal with various situations of automated assembly line, the optimal solution can be derived by the branch and bound method of analysis. By the application of line balancing algorithm to telephone assembly line, thoughput is improved by 3.38%. Therefore, in the proposed line, blicking phenomena were reduced and smooth line-flow was achieved, and uniform distribution of utilization rate of each machine is obtained.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.13
• /
• pp.45-50
• /
• 1986

본 연구에서 고찰한 surrogate relaxation은 Lagrangian relaxation 방법과는 달리 제약식들을 선형조합으로 묶어 문제를 푼다. 수리계획 분계가 convexity를 만족하지 못하는 경우에는 Lagrangian의 경우와 마찬가지로 surrogate gap이 발생한다. Lagrangian 쌍대이론을 토대로 surrogate optimality condition을 알아보고 수리계획법의 특별 형태인 정수선형계획법에 적용해 보았다. 일반적으로 surrogate gap은 Lagrangian gap 보다 작기 때문에 좀더 근사하게 원 문제의 최적 목적 함수값에 접근할 수 있다. 따라서 branch and bound 알고리즘을 개발할 때 중요한 정보를 제공하는 것이다.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.51-61
• /
• 1983

Lagrangian relaxation is used to the problem of scheduling jobs on unrelated parallel processors with the objective of minimizing makespan. The implicit condition for optimality is drawn out explicitly in order to apply the subgradient algorithm. To obtain the optimal solution, branch-and-bound-search method is devised. In the search, the special structure of the problem is exploited effectively, Some computational experiences with the algorithm are presented, and comparisons are made with the Land and Doig method.