• 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.

• IE interfaces
• /
• v.11 no.3
• /
• pp.129-141
• /
• 1998

In this paper, a rescheduling procedure is developed for shipbuilding master production schedule. Shipyard initially develops backward production schedules for the entire shipbuilding process, and then refines the schedule by stage. The rescheduling procedure of this paper tries to resolve the schedule discrepancies between the outdoor backward schedule and the refined indoor schedule. Through the proposed rescheduling procedure, outdoor schedule can be successfully adjusted using buffer days and duration reduction. An Object-oriented program is also developed to automate the procedure. We can observe the improvement on productivity and quality of rescheduling works from the application of the developed procedure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.47-55
• /
• 2015

This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.1
• /
• pp.20-28
• /
• 2016

This paper presents a generation rescheduling method for the enhancement of transient stability in power systems. The priority and the candidate generators for rescheduling are calculated by using the energy margin sensitivity. The generation rescheduling formulates the Lagrangian function with the fuel cost and emission such as NO_x and SO_x from power plants. The generation rescheduling searches for the solution that minimizes the Lagrangian function by using the Newton’s approach. While the Pareto optimum in the fuel cost and emission minimization has a drawback of finding a number of non-dominated solutions, the proposed approach can explore the non-inferior solutions of the multiobjective optimization problem more efficiently. The method proposed is applied to a 4-machine 6-bus system to demonstrate its effectiveness.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.2
• /
• pp.255-260
• /
• 2017

This paper studies on effective rescheduling of generation when the single line contingency has occurred in power system with wind farm. The suggested method is formulated to minimize the rescheduling cost of conventional and wind generators to alleviate congestion. The generator rescheduling method has been used with incorporation of wind farms in the power system. Since all sensitivity is different about congestion line, Line Outage Distribution Factor(LODF) and Generator Sensitivity Factor(GSF) is used to alleviate congestion. The formulation have been proccessed using linear programming(LP) optimization techniques to alleviate transmission congestion. The effectiveness of the proposed rescheduling of generation method has been analyzed on revised IEEE 30-bus systems.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.51-62
• /
• 2013

This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

• International Journal of Precision Engineering and Manufacturing
• /
• v.5 no.2
• /
• pp.22-31
• /
• 2004

A problem of task rescheduling using a coordinator in a structural decentralized control of supervisory control theory is formulated. we consider that the overall system is divided into a number of local systems. Using an example of a chemical batch reaction process, it has shown that after local supervisors have been established for a given task, a coordinator can be used to solve some rescheduling problems among local plants for new or modified tasks. The coordination system models the interactions of local plants, and is consisting of only the shared events of local plants, so simpler to synthesize. A coordinator is designed based on the specifications given for the coordination system. Under the 'structural' conditions developed in this paper, the combined concurrent actions of the coordinator with the existing local supervisors will achieve the rescheduling requirements. Again since the conditions are structural (not specification-dependent), once the coordination architecture has been established, it can be used for a number of different tasks without further verifications.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.1
• /
• pp.32-41
• /
• 2011

This paper presents a new method of Fuzzy Particle Swarm Optimization (FPSO)-based Congestion Management (CM) by optimal rescheduling of active powers of generators. In the proposed method, generators are selected based on their sensitivity to the congested line for efficient utilization. The task of optimally rescheduling the active powers of the participating generators to reduce congestion in the transmission line is attempted by FPSO, Fitness Distance Ratio PSO (FDR-PSO), and conventional PSO. The FPSO and FDR-PSO algorithms are tested on the IEEE 30-bus and Practical Indian 75-bus systems, after which the results are compared with conventional PSO to determine the effectiveness of CM. Compared with FDR-PSO and PSO, FPSO can better perform the optimal rescheduling of generators to relieve congestion in the transmission line.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.3
• /
• pp.302-310
• /
• 2011

Congestion management is one of the most challenging tasks of a system operator to ensure the operation of transmission system within operating limits. In this paper, cluster/zone method and relative electrical distance (RED) method for congestion management are compared based on the considered parameters. In the cluster/zone method, rescheduling of generation is based on user impact on congestion through the use of transmission congestion distribution factors. In the RED method, the desired proportions of generations for the desired overload relieving are obtained. Even after generation rescheduling, if congestion exists, load curtailment option is also introduced. Rescheduling cost, system cost, losses, and voltage stability parameter are also calculated and compared for the above two methods of congestion management. The results are illustrated on sample 6-bus, IEEE 30-bus, and Indian utility 69-bus systems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.1965-1970
• /
• 2016

This paper studies generator rescheduling technique for congestion management in power system with wind farms. The proposed technique is formulated to minimize the rescheduling cost of conventional and wind generators to alleviate congestion subject to operational line overloading. The generator rescheduling method has been used with incorporation of wind farms in the power system. The locations of wind farms are selected based upon power transfer distribution factor (PTDF). Because all generators in the system do not need to participate in congestion management, the rescheduling has been done by generator selection based on the proposed generator sensitivity factor (GSF). The selected generators have been rescheduled using linear programming(LP) optimization techniques to alleviate transmission congestion. The effectiveness of the proposed methodology has been analyzed on IEEE 14-bus systems.