• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.218-224
• /
• 2014

The logic-based scheduling language RCPSV may be used to model resource-constrained project scheduling problems with variants for minimizing the project completion time. A diagram-based, nonredundant enumeration algorithm for the RCPSV-problem is proposed and the correctness of the algorithm is proved.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.159-163
• /
• 2001

An input constrained receding horizon predictive control algorithm for uncertain systems with nonzero set points is proposed. for constant nonzero set points, models with uncertainty can be converted into an augmented incremental system through the use of integrators and the problem is transformed into a zero-state regulation problem for the incremental system. But the original constraints on inputs are converted into constraints on the sum of control inputs at each time instants, which have not been dealt in earlier constrained robust receding horizon control problems. Recursive state bounding technique and worst case minimizing strategy developed in earlier works are applied to the augmented incremental system to yield an offset error free controller. The resulting algorithm is formulated so that it can be solved using LP.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.95-108
• /
• 2013

The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.359-360
• /
• 2006

This paper introduces a variable of methodology and models of solving Security-Constrained Price-Based Unit Commitment(SPUC) Problems in the Deregulated Power Market. The objective of SPUC is coordination between GENCOs and the ISO. GENCOs apply Price-Based Unit Commitment(PBUC) without security constraints and submit capacity bids to the ISO for maximizing their revenues. Using generation data and transmission data obtained from TRANSCOs, the ISO applies Security-Constrained Unit Commitment(SCUC), executes congestion management and contingency analysis for minimizing line flow violations and the risk supplying loads. Considering analysis data, the ISO should adjust GENCOS' bid. In this paper, we presents the result of survey and analyze on the approach of the SPUC problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.502-502
• /
• 2000

An input constrained receding horizon predictive control algorithm for uncertain systems with nonzero set points is proposed. For constant nonzero set points, models with uncertainty can be converted into an augmented incremental system through the use of integrators and the problem is transformed into a zero-state regulation problem for the incremental system. But the original constraints on inputs are converted into constraints on the sum of control inputs at each time Instants, which have not been dealt in earlier constrained robust receding horizon control problems. Recursive state bounding technique and worst case minimizing strategy developed in earlier works are applied to the augmented incremental system to yield an of set error free controller. The resulting algorithm is formulated so that it can be solved using LP.

• Journal of the Korean Mathematical Society
• /
• v.37 no.6
• /
• pp.977-989
• /
• 2000

In this paper we construct a standing solitary wave solution with prescribed total electric charge to the planer Chern-Simons gauged nonlinear Schrodinger equation with an external electromagnetic field by using a variations method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.672-681
• /
• 2000

Based on the dynamic anti-windup strategy a novel control methodology for state constrained control systems is presented. First a linear controller is designed for an open-loop stable plant to show a desirable nominal performance by ignoring state constraints. And then an additional dynamic compensator is introduced to preserve the nominal performance as closely as possible int he face of state constraints. This paper focuses on the second step under the assumption that a linear controller has already been designed appropriately by using an effective controller design method. By minimizing a reasonable performance index the dynamic compensator is derived explicitly which is expressed int he plant and controller parameters. the proposed method not only guarantees the total stability of the overall resulting systems but also provides desirable output performance because it solves the state-positioning problem completely.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.219-224
• /
• 2005

Developable surface plays an important role in computer aided design and manufacturing systems. This paper is concerned with improving the develop ability of mesh. Since subdivision is an efficient way to design complicated surface, we intend to improve the developability of the mesh obtained from Loop subdivision. The problem is formulated as a constrained optimization problem. The optimization is performed on the coordinates of the points of the mesh, together with the constraints of minimizing shape difference and maximizing developability, a developability improved mesh is obtained.

• 전기의세계
• /
• v.30 no.5
• /
• pp.297-305
• /
• 1981

The problem of finding shortest paths between every pair of points in a network is solved employing and optimal network decomposition in which the network is decomposed into a number of subnetworks minimizing the number of cut-set between them while each subnetwork is constrained by a size limit. Shortest path computations are performed on individual subnetworks, and the solutions are recomposed to obtain the solution of the original network. The method when applied to large scale networks significantly reduces core requirement and computation time. This is demonstrated by developing a computer program based on the method and applying it to 30-vertex, 160-vertex, and 273-vertex networks.