• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.1940-1949
• /
• 2015

This paper presents an Enhanced Particle Swarm Optimization (EPSO) to solve short-term hydrothermal scheduling (STHS) problem with non-convex fuel cost function and a variety of operational constraints related to hydro and thermal units. The operators of the conventional PSO are dynamically controlled using exponential functions for better exploration and exploitation of the search space. The overall methodology efficiently regulates the velocity of particles during their flight and results in substantial improvement in the conventional PSO. The effectiveness of the proposed method has been tested for STHS of two standard test generating systems while considering several operational constraints like system power balance constraints, power generation limit constraints, reservoir storage volume limit constraints, water discharge rate limit constraints, water dynamic balance constraints, initial and end reservoir storage volume limit constraints, valve-point loading effect, etc. The application results show that the proposed EPSO method is capable to solve the hard combinatorial constraint optimization problems very efficiently.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.235-245
• /
• 1998

This paper presents the fuzzy optimization model based scheduling methodology for the efficient production control of a FFS(FIexible Flow Shop) under the uncertain production environment. To develop the methodology, a fuzzy optimization technique is introduced in which the uncertain production capacity caused by the random events like the machine breakdowns or the absence of workers is modeled by fuzzy number. Since the problem is NP hard, the goal of this study is to obtain the near optimal but practical schedule in an efficient way. Thus, Lagrangian relaxation method is used to decompose the problem into a set of subproblems which are easier to solve than the original one. Also, to construct the feasible schedule, a heuristic algorithm was proposed. To evaluate the performance of the proposed method, computational experiments, based on the real factory data, are performed. Then, the results are compared with those of the other methods, the deterministic one and the existing one used in the factory, in the various performance indices. The comparison results demonstrate that the proposed method is more effective than the other methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.59-68
• /
• 2001

The job shop scheduling problem is not only NP-hard, but is one of the well known hardest combinatorial optimization problems. The goal of this research is to develop an efficient scheduling method based on hybrid genetic algorithm to address job shop scheduling problem. In this scheduling method, generating method of initial population, new genetic operator, selection method are developed. The scheduling method based on genetic algorithm are tested on standard benchmark job shop scheduling problem. The results were compared with another genetic algorithm0-based scheduling method. Compared to traditional genetic, algorithm, the proposed approach yields significant improvement at a solution.

• Journal of the Korea Safety Management & Science
• /
• v.25 no.2
• /
• pp.1-8
• /
• 2023

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.37-42
• /
• 2000

The parallel machines scheduling problems is one of the combinatorial optimization problems that often occurs in the real world. This problem is classified into two cases, one of which is the case which processing time are identical and the other, nonidentical. Not so much researches have been made on the case that nonidentical parallel machines scheduling problem. This study proposes Tabu Search methods for solving parallel machines scheduling problems related to due dates: minimizing mean tardiness, minimizing the number of tardy jobs, minimizing the maximum tardiness.

• Journal of Industrial Technology
• /
• v.26 no.A
• /
• pp.173-180
• /
• 2006

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. In this paper, an shipbuilding scheduling system for outfitting and painting is presented based on constraint satisfaction techniques(CST). We provide a field based model and an efficient solution methodology by using ILOG Scheduler and Solver. ILOG Solver support extensive optimization goals easily. We do verify the improvement and efficiency of the schedule generated by the scheduling system presented in this paper.

• Journal of Industrial Convergence
• /
• v.1 no.2
• /
• pp.69-79
• /
• 2003

In order to solve scheduling, many techniques including optimization and heuristics methods have been proposed. However, these conventional approaches are usually inadequate to obtain a satisfactory solution because of a NP-Complete which requires extensive computation effort. The aim of this paper is to develop an expert system for job shop scheduling using an AI technique. Through this system, the user can choose one of several performances. If one performance is chosen, then the system solves a scheduling in order to satisfy that performance. Then, this system decides urgent job. This system can utilize production resources efficiently and minimize work-in-process inventories and tardy jobs.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.273-276
• /
• 2006

At an integrated steel mill, various raw material such as coal and iron ore are unloaded from a large ship. The unloaded raw material is then transported to storage yards through a complex belt conveyer network. We propose an optimization model for scheduling the unloading operations under the limitations of available berths, unloading equipments and transportation capacity of the belt conveyer network. We show that the problem is NP-Hard and propose a heuristic approach to the problem.

• Korean Management Science Review
• /
• v.32 no.4
• /
• pp.69-80
• /
• 2015

The semiconductor industry is one of those in which the most intricate processes are involved and there are many critical factors that are controlled with precision in those processes. Naturally production scheduling in the semiconductor industry is also very complex and studied by the industry and academia for many years; however, still there are many issues left unclear in the problem. This paper proposes an multi-objective optimization-based scheduling method for semiconductor fabrication(fab). Two main objectives are throughput maximization and meeting target production quantities. The first objective aims to reduce production cost, especially the fixed cost incurred by a large investment constructing a new fab facility. The other is meeting customer orders on time and also helps a fab maintain stable throughput through controlled WIP balancing in the long run. The paper shows a trade-off structure between the two objectives through experimental studies, which provides industrial practitioners with useful references.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.37-48
• /
• 2014

Fighter squadron flight scheduling is the integrated air operation plan that is an important role for improving pilot's flight skill and maintaining combat readiness by efficient using available all air resources including pilot, aircrafts, air-weapons, fuel and supporting facilities etc. Korea airforce, however, has a limit as to an effective flight operation due to manual flight scheduling with scheduler's own experience and intuition. Therefore, in our study, we propose the optimization model of flight scheduling based on mixed integer programming. This model includes several constraints of realistic and essential quantified data related with flight schedule and can assign appropriate pilots optimally which are distinctive three type's solutions : flight, alert and duty crew schedules. Proposed solution method can be improved pilot's capability and allocated further air resources systematically and efficiently. In addition, it can be reduced a workload of flight scheduler and minimized obstructed factors of flight safety. Finally, we demonstrate the experiment's results for the check of efficiency and validity of this model.