• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2571-2580
• /
• 1997

In this paper, we deal with the resource constrain scheduling to execute behavior algorithm under resource limit. Expecially, we proposed a scheduling algorithm, called delayed scheduling, which finds the lower bound control step to assign operation under resource limit. We take in account the actual scheduling problems including multicycle operation and functional pipelining. Integer Linear Programing formulations are used to the scheduling problems in order to get optimal scheduling result. Experiment was done on the DFG model of fifth-order digital wave filter, to show it's effectiveness.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.139-149
• /
• 1994

In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.410-420
• /
• 1994

In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3358-3365
• /
• 2012

This paper presents a scheduling scheme for die casting processes considering power usage. The scheduling problem of a shift-based die casting process is represented by a linear programming (LP) model that maximizes the average efficiency of melting furnaces in regard of the usage of molten alloy, where the product quantities of each shift are used as primary variables. In this research, we propose a novel LP model that considers power usage of foundries. The developed LP model can derive product plans in which the expended power of a casting shift does not exceed a prescribed limit, while optimizing the efficiency of alloy usage. The simulation result of a case study demonstrates the superiority and applicability of the proposed scheme. This paper serves as a basic research on the role of foundries as an intelligent costumer in smart grid environment where the limit of power usage should be fulfilled.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.945-949
• /
• 2004

These days there are so many scheduling systems or softwares. But only few scheduling systems have succeeded in the market. In spite of powerful engine and functions, those systems have difficulties to be applied in real processes. In real processes, there are various constraints caused by physical or systematical environments of plants. Those constraints are too many to be handled in the system. This problem makes it difficult for the system to represent the details of processes. In order to resolve this problem, we have developed a specialized scheduling system for a target process. The system could be developed by the experts for target process and researchers for scheduling. In this study, a scheduling system for PVC process has been developed as an MILP (Mixed integer linear programming) model and coded in $Fortran^{TM}$. The scheduling system has been applied to two processes, which have different characteristics. Simulation results indicate that the profit of the target process can be increased by about 5% by implementing the scheduling system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.163.3-163
• /
• 2001

This paper presents the two-step strategy method of performing optimal scheduling of paper mill processes using MINLP (Mixed-Integer Non-Linear Programming) considering the trim loss problem in sheet cutting processes. The mathematical model for a sheet cutting process in the form of MINLP is developed in this study, and minimizing total cost is performed considering the cost of raw paper roll, :hanging cutting patterns, storage of over-product and recycling/burning trim. The paper has been used to deliver and conserve information for a long time, and it is needed to have various sizes and weights ...

• Journal of Korea Water Resources Association
• /
• v.52 no.8
• /
• pp.565-573
• /
• 2019

An optimization model of water intake planning is developed based on a linear programming (LP) for the intelligent water purification plant operation system. The proposed optimization model minimizes the water treatment costs of raw water purification by considering a time-delay of treatment process and hourly electricity tariff, which is subject to various operation constraints, such as water intake limit, storage tank capacity, and water demand forecasts. For demonstration, the developed model is applied to H water purification center. Here, we have tested three optimization strategies and the results are compared and analyzed in economic and safety aspects. The optimization model is expected to be used as a decision support tool for optimal water intake scheduling of domestic water purification centers.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2196-2203
• /
• 1999

This paper describes the bus scheduling problem and register optimization method in datapath synthesis. Scheduling is process of operation allocation to control steps in order to minimize the cost function under the given circumstances. For that purpose, we propose some formulations to minimize the cost function for bus assignment to get an optimal and minimal cost function in hardware allocations. Especially, bus and register minimization technique are fully considered which are the essential topics in hardware allocation. Register scheduling is done after the operation and bus scheduling. Experiments are done with the DFG model of fifth-order digital ware filter to show its effectiveness. Structural integer programming formulations are used to solve the scheduling problems in order to get the optimal scheduling results in the integer linear programming environment.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.20 no.1
• /
• pp.28-36
• /
• 2016

Theoretical model of a variable thrust solid rocket motor with a pintle nozzle was derived. For the chamber pressure control, classical model linearization and proportional-intergral controller was used. And then two types of gain scheduling controller were suggested to imporve controller performance for the non-linear propulsion model. Considering characteristics of systems, control gains were scheduled by chamber pressure or free volume. Step responses of each controllers were compared. As a result, the proper control algorithm about characteristics of variable thrust rocket motor was suggested.