• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.538-541
• /
• 2000

Goldratt박사에 의해 제창된 TOC(Theory of Constraints)는 제약조건을 찾아 개선시켜 없애고 시스템 심과를 높일 수 있는 방안을 찾는 제약이론이다. 생산공정을 포함한 모든 분야에서 제약이란 없을 수가 없다. 따라서 기존의 MRP나 PERT/CPM과 같은 무한 자원 스케줄링으로는 예상하지 못한 문제가 도출될 수 밖에 없는 한계를 제약공정의 자원능력이 유한하다는 가정에서 출발하는 제약이론으로 자원활용의 최적화를 도모할 수 있다. 본 논문에서는 TOC와 많은 유사점을 가지고 있는 생산시스템인 JIT와 비교하여 아직 국내에는 활발한 연구가 이루어지고 있지 않은 TOC를 기반으로 최적 생산시스템을 연구하고자 한다.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1088-1095
• /
• 1999

This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.72-75
• /
• 1988

Due to the fact that the set point regulation scheme by the variable structure control method concerns only the initial and final locations of a manipulator, many constraints may exist in the application of path tracking with obstracle avoidance. The variable structure parameter should be selected in the trajectory planning step by satisfying the constraints of the travel time and the path deviations This paper presents the selection algorithm of the variable structure parameters with the constraints of the system dynamics and the travel time and the path deviation. This study makes unify the trajectory planning and tracking control using the variable structure control method.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.920-923
• /
• 2002

In this paper, we propose Class Diagram With Constraints (CDWC) as an object oriented modeling technique which makes validation possible in software development. CDWC is a simple and basic model for the object oriented analysis, and has a reasonable strictness for software developers. CDWC consists of class diagrams and constraints (invariant and pre/post conditions), using UML and a subset of OCL.. We introduce a method of validation of CDWC using the verification technique of algebraic formal specification language CafeOBJ.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.1
• /
• pp.31-38
• /
• 1993

This paper presents a possible methodology to develop a facility layout using practical constraints. Those factors considered in the system are not only used for the evaluation of layout but also for the search to solution on the design process. Necessarily, this method develops practically feasible solutions with less iterations since the infeasible alternative layouts are rejected by the practical constraints before evolutions. The suggested method is implemented in FORTRAN for experimental purposes and the results are discussed in detail.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.215-229
• /
• 2005

In this paper, constraint aggregation is combined with the adjoint and multiple shooting strategies for optimal control of differential algebraic equations (DAE) systems. The approach retains the inherent parallelism of the conventional multiple shooting method, while also being much more efficient for large scale problems. Constraint aggregation is employed to reduce the number of nonlinear continuity constraints in each multiple shooting interval, and its derivatives are computed by the adjoint DAE solver DASPKADJOINT together with ADIFOR and TAMC, the automatic differentiation software for forward and reverse mode, respectively. Numerical experiments demonstrate the effectiveness of the approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.159-170
• /
• 1992

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.171-180
• /
• 1992

This paper proposes a solution approach to linear problems with many constraints of variable upper bound (VUB) type. This type of constraints are commonly found in various scheduling type problems for which tighter bounds are essential to achieve an efficiency in enumeration. An analytical framework based on factorization is adopted to devise a solution approach to the problem and extend it for more generalized VUB problem (GVUB). This research shows why the VUB type constraints are amenable to the factorization and gives a unified approach to generalized upper bound(GUB) problems, VUB problems and GVUB problems. Implementation issues are also included.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.515-524
• /
• 2004

We prove the local existence of solution for nonconvex-valued differential inclusion under time-varying state constraints.