• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.288-289
• /
• 1992

The method of simulated annealing is a technique that has recently attracted significant attention as suitable for optimization problem of very large scale. If the temperature is too high, then some of the structure created by the heuristic will be destroyed and unnecessary extra work will be done. If it is too low then solution is lost, similar to the case of a quenching cooling schedule in the Simulated Annealing (SA) phase. Therefore, a crucial issue in this study is the determination of the starting temperature and cooling schedule for SA phase.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.740-742
• /
• 2004

In TWBP markets, ISO determines the maintenance schedule based on Gencos' and Transcos' offers under reasonable criterion. This paper presents ISO's alternative procedure to coordinate maintenance schedules submitted by Gencos and Transcos. ISO's coordination procedure is formulated as an optimization problem that minimizes expected losses in Gencos' revenue subject to system reserve requirement.

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

We study the Multiple Product Single Facility Stockout Avoidance Problem (SAP). That is the problem of determining, given initial inventories, whether there is a multiple product single facility production schedule that avoids stockouts over a given time horizon. The optimization version of the SAP where stockouts are pnelized linearly is also studied. We call this problem the Weighted Stockout Problem (WSP). Both problems are NP-hard in the strong sense. We develop Mixed Integer Linear Programming (MIP) formulations for both the SAP and the WSP. In addition, several heuristic algorithms are presented and performances are tested using computational experiments. We show that there exist polynomial algorithms for some special cases of the SAP and the WSP. We also present a method to phase into a target cyclic schedule for infinite horizon problems. These can be used as a practical scheduling tool for temporarily overloaded facilities or to reschedule production after a disruption.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.643-645
• /
• 2003

In competitive electricity markets, each GenCo establishes generator maintenance schedule and submits to ISO those. Then, ISO reviews and arranges maintenance schedule of each GenCo to meet the standard for reliability. This paper presents the new optimization model which can apply to competitive electricity markets. The object of this model is to minimize schedules variation of each GenCo and to satisfy system reliability.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.91-104
• /
• 1992

Flowshop scheduling problem is known to be NP-complete. Since the optimization apporach like branch-and-bound is limited by exponentially growing computation time, many heuristic methods have been developed. Total tardiness is one of the criteria that the researchers have recently considered in flowshop scheduling. There, however, are few literatures which studied the general (m machine)-flowshop scheduling under the total tardiness criterion. In this paper, a heuristic scheduling method to minimize total tardiness at the (m machine, n job)-flowshop is presented. A heuristic value function is proposed to be used as a dispatching criterion in initial schedule generation. And the schedule improving procedure, by pairwise interchange of tardy job with the job right ahead of it, is introduced. Illustrative examles and simulated results are presented.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.341-343
• /
• 1998

Hitherto, train schedules are made by several human experts and the scheduling is very long and tedious job. Moreover those results are not accepted as the optimal solution. The purpose of this research is the finding of optimal methodology and useful constraints for locomotive scheduling. For these purposes, the interactive simulation program for train linking schedule is developed. Some constraints and technique for train linking scheduling is able to be edited or modified by various interactive windows. The constraints, rules and methodology for scheduling can be analyzed and also obtained useful schedule results by using this program.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.941-946
• /
• 2005

It is essential for project managers to make schedule adjustment based on their professional experience, in terms of rescheduling action discussed in this paper. This paper discusses the topics of resource-constrained construction rescheduling by modifying the concepts of manufacturing rescheduling. Moreover, the influence factors of construction rescheduling problems are investigated and identified in this paper. According to initial schedule plan and present progress, a new rescheduling mechanism based on Constraint Programming (CP) techniques is developed to reschedule projects with the objective of minimizing total project cost or duration, under three rescheduling policies. Through case study, the behavior of three different rescheduling policies is analyzed and discussed in this paper.

• Journal of the Korean Solar Energy Society
• /
• v.37 no.6
• /
• pp.69-77
• /
• 2017

The amount of solar irradiation obtained by a photovoltaic (PV) solar panel is the major factor determining the power generated by a PV system, and the array tilt angle is critical for maximizing panel radiation acquisition. There are three types of PV systems based on the manner of setting the array tilt angle: fixed, semi-fixed, and tracking systems. A fixed system cannot respond to seasonal solar altitude angle changes, and therefore cannot absorb the maximum available solar radiation. The tracking system continually adjusts the tilt angle to absorb the maximum available radiation, but requires additional cost for equipment, installation, operation, and maintenance. The semi-fixed system is only adjusted periodically (usually seasonally) to obtain more energy than a fixed system at an overall cost that is less than a tracking system. To maximize semi-fixed system efficiency, determining the optimal tilt angle adjustment schedule are required. In this research, we conducted a simulation to derive an optimal operation schedule for a semi-fixed system in Seoul, Korea (latitude $37.5^{\circ}$). We implemented a solar radiation acquisition model and PV genereation model on MATLAB. The optimal operation schedule was derived by changing the number of tilt angle adjustments throughout a year using a Dynamic Algorithm. The results show that adjusting the tilt angle 4 times a year was the most appropriate. and then, generation amount of PV system increased 2.80% compared with the fixed system. This corresponds to 99% compared to daily adjustment model. This increase would be quite valid as the PV system installation area increased.

• Journal of Korean Society for Quality Management
• /
• v.50 no.2
• /
• pp.265-286
• /
• 2022

Purpose: The time and cost of a project activity exists in a selected mode and there is a quality level for the selected mode, and the time and cost of the current activity is determined by the quality level of the preceding activity. When an activity is a predecessor activity of an activity, it is characterized as a trade-off problem in which the time and cost of the activity are determined according to the quality level of the activity. Methods: A neighbor search heuristic algorithm obtains a solution by (1) randomly determining the mode, quality level, and assignment order for each activity. (2) get a solution by improving the solution by changing the possible modes and quality levels; (3) to find a solution by improving the solution from the point where it is feasible to advance the start time. Here, Case[1] is a method to find the optimal solution value after repeating (1). Case [2] is a method for finding a solution including (1) and (2). Case [3] refers to a method for finding solutions including (1), (2), and (3). Results: It can be seen that the value of the objective function presented by the algorithm changes depending on how the model of the heuristic algorithm is designed and applied. In other words, it suggests the importance of algorithm design and proves the importance of the quality problem of activities in the project schedule. Conclusion: A study significance of the optimization algorithm and the heuristic algorithm was applied to the effect of the quality of the preceding activity on the duration and cost of itself and the succeeding activity, which was not addressed in the project schedule problem.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.10
• /
• pp.240-247
• /
• 2020

The Korean military is having difficulty maintaining combat power due to the insufficient troop numbers caused by a demographic cliff and the reduction of the mandatory military service period. Recently, discussions on improving the military training system have increased significantly. This paper proposes an optimization model to establish military training schedules to improve combat power. The oblivion and learning effects on training tasks were quantified through a survey and applied to the model. The objective value, combat power, was calculated based on the total task scores of the unit members and the number of task failures after four weeks. The scenarios were configured by the change in educational conditions and initial scores of some tasks. As a result of scenario experiments, combat power has increased by at least 10% and up to 77%, which is sufficient to maintain combat power considering the change in troops. In addition, the planning of combat skill tasks has a significant impact on combat power. Through this research model, it is expected that military training managers will be able to establish a training schedule that maintains or improves the combat power of troops effectively.