• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.65-77
• /
• 1994

There are so many situations in which production schedules need to be rescheduled, due to the uncertainty or dynamic characteristics existing in manufacturing environment. Under the circumstances, it is necessary to build a system which helps a schedule manager understand the dynamic situations and reflect his insight into the system easily. We developed a system that can improve a production schedule. The system consists of a schedule editor and a schedule generator. The schedule editor, a rule-based system, always keeps a schedule feasible by keeping track of local changes in the revised one. The schedule generator consists of a two-phase heuristic method. In the lst phase it generates a schedule by a priority rule with Giffler and Thompson algorithm then it improves the performance in terms of the makespan in the 2nd phase. Experimental results show that, most of the times, the system generates a better schedule than the one with ordinary priority rules only.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.8
• /
• pp.477-483
• /
• 2004

In competitive electricity markets, maintenance schedule is submitted by generation companies (GENCOs) and transmission companies (TRANSCOs), and coordinated by Independent System Operator (ISO) with the adequacy criterion. This paper presents an alternative coordination procedure by ISO on the maintenance schedule. In this paper, it is focused on modeling a coordination algorithm by ISO for the maintenance schedule based on the Simulated Annealing algorithm. The proposed model employs the minimum information such as generator capacity, forced outage rate and generator maintenance schedules. The objective function of this model represents minimization of adjustment on schedules submitted by GENCOs.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.447-449
• /
• 2003

In competitive electricity markets, maintenance schedule is submitted by Genco's and Transco's, and coordinated by ISO with the adequacy criterion. This paper presents an alternative coordination procedure by ISO on the maintenance schedule.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.7
• /
• pp.352-357
• /
• 2005

In competitive electricity markets, the System Operator (SO) coordinates the overall maintenance schedules when the collective maintenance schedule reported to 50 by Gencos not satisfy the specified operating criteria, such as system reliability or supply adequacy. This paper presented a method that divides generator maintenance scheduling of the 50 into a master-problem and a sub-problem. Master-problem is schedule coordination and sub-problem is DC-optimal power flow. If sub-problem is infeasible, we use the algorithm of modifying operating criteria of master-problem. And, the 50 should use the open information only, because the information such as cost function of a generator and bidding Price is highly crucial for the strategies of profit maximization.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.12
• /
• pp.685-688
• /
• 2004

In competitive electricity markets, the System Operator (SO) coordinates the overall maintenance schedules whenever the collective maintenance schedule reported to SO by Gencos in the pool does not satisfy the specified operating criteria, such as system reliability or supply adequacy. The SO's coordination usually involves sorts of financial conflict among Genco's. This paper proposes a coordination algorithm which minimizes the total financial loss of Genco's while satisfying the required operating criteria.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.115-121
• /
• 2007

In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permutation schedule which minimizes the makespan. As a solution procedure, we propose an improved genetic algorithm which utilizes a look-ahead schedule generator to find good solutions in a reasonable time Computational experiments show that the proposed genetic algorithm outperforms the existing genetic algorithm.

• Proceedings of the KSR Conference
• /
• 1999.11a
• /
• pp.46-53
• /
• 1999

As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

• 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 Society of Transportation
• /
• v.8 no.2
• /
• pp.67-75
• /
• 1990

This paper treats the problem to schedule for trains with how transit priority so as to maximizing the number that can be sent during given time periods without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time Expanded Network without traverse time through application of Ford and Fulkerson Model and construct the Enumeration Algorithm for solutions using TENET Generator (TENETGEN). Finally, we compare our algorithm with Dinic's Maximal-Flow Algorithm and examine the avaliability of our procedures in personal computer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.111-117
• /
• 1990

This paper treats the problem to schedule for train with low transit priority so as to maximizing the number that can be sent during given time without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time-Expanded Network without traverse time through application of Ford-Fulkerson Model, develop a TENET GENerator(TENETGEN) and obtain the data of TENET using developed TENETGEN. Finally, we seek the optimal solution to these data with Dinic's Maximal-Flow Algorithm and examine the availability of our procedures in personal computer.