14 vistas

Cargado por Sheikh.H

Maintenance Scheduling With Network Constraints

guardar

Está en la página 1de 6

3, Auguslt 1998

1063

**INTEGRATED GENERATION AND TRANSMISSION MAINTENANCE SCHEDULING
**

WITH NETWORK CONSTRAINTS

M.K.C. Marwali

S.M. Shahidehpour

Department of Electr ical and Computer Engineering

Illinois Institute of Technology

Chicago, Illinois 606 16

Abstract- Most unit maintenance scheduling packages consider

preventive maintenance schedule of generating units over a on(: or

two year operational planning period in order to minimize the t3tal

operating cost while satisfying system energy requirements and

maintenance constraints. In a global maintenance scheduiing

problem, we propose to consider transmission line maintenance

scheduling and line capacity limits along with generation and line

outages. The inclusion of transmission and network constraint:; in

generating unit maintenance will increase the complexity of the

problem, so we propose

to decompose

the global

generator/transmission scheduling problem into a master problem

and sub-problems using Benders decomposition. In the first stage, a

master problem is solved to determine a solution for maintenance

schedule decision variables. In the second stage, sub-problems are

solved to minimize operating costs while satisfying the network

constraints. Benders cuts based on the solution of the sub-problem

are introduced to the master problem for improving the existing

solution. The iterative procedure continues until an optimal or near

optimal solution is found.

Keywords: Generation maintenance scheduling, transmission

maintenance scheduling, Benders decomposition.

1. INTRODUCTION

Additional competition and growing complexity in power

generating systems, as well as a need for high service reliability and

low production costs, are provoking additional interests in automatic

scheduling techniques for maintenance of generators, transmission

and related equipment, capable of providing least cost maintenance

schedules.

In earlier works of thermal generator maintenance scheduling, most

techniques were based on heuristic approaches. These approaches

consider generating unit separately in selecting its optimal outage

interval subject to constraints and an objective criterion for

equalizing or leveling reserves throughout the planning interval [I],

minimizing expected total production costs [6, IO] or leveling the

risk of failure to meet demand [2]. An example of an heuristic

approach would be to schedule one unit at a time beginning with the

largest and ending with the smallest. Most methods, mainly those

based on heuristics, represent only the generation system and do not

take into account the networks constraint effects on generation and

transmission maintenance. Recently [I 31 represented transmission

constraints, but did not recognize interconnection failures and

maintenance, [ 141 recognized the composite generation and

transmission reliability but did not consider transmission

maintenance.

Because of the discrete nature of maintenance schedu,ing,

mathematical programming approaches have fallen into two b-oad

categories: integer programming (branch and bound) [4-51 and

dynamic programming [3]. More recently, Benders decomposition

has been applied to decompose the problem into a master problem

and a series of sub-problems. The coordination of master and :SubPE-185-PWRS-I 6-09-1997 A paper recommended and approved by

the IEEE Power System Engineering Committee of the IEEE Power

Engineering Society for publication in the IEEE Transactions on Power

Systems. Manuscript submitted May 27, 1997; made available for

printing September 30, 1997.

**problems results in the solution of generator maintenance scheduling
**

as reported in [10,14].

This paper extends the Benders decomposition to include

transmission maintenance and network constraints in the

maintenance scheduling problem. The network is modeled as a

probabilistic problem to include the effect of generation and

transmission outages. Section 2 describes the formulation of

maintenance scheduling with network constraints. Section 3

describes the approach of the maintenance problem using Benders

decomposition. The network model used in the proposed method,

the maintenance sub-problem and operation sub-problem are also

discussed in section 3. A detailed example and the result of the

application of the proposed method to IEEE-RTS [1 I] are presented

in sections 4 and 5.

2. PROBLEM DESCRIPTION

The maintenance scheduling problem is to determine the period for

which generating units of an electric power utility should be taken

off line for planned preventive maintenance over the course of a one

or two year planning horizon in order to minimize the total

operating cost while system energy, reliability requirements and a

number of other constraints are satisfied.

Generating units are distributed in different regions and

interconnected by transmission lines. This may lead to different

composite reliability levels for a given amount of maintenance

capacity outage. Furthermore, generating unit maintenance should

consider transmission forced and planned outages. When

transmission maintenance and other network constraints are

included, the problem becomes considerably more complex and will

be referred to as an integrated maintenance scheduler (IMS) which

represents a network constrained generation and transmission

maintenance scheduling problem. The methodology for the solution

of this problem is discussed in this paper.

In general there are two approaches which can be employed to

achieve one or more aspects of generation maintenance. These

approaches are fictitious cost and maintenance window. Due to

difficulties in obtaining “field proven” maintenance costs, fictitious

costs are often used to penalize deviations from an ideal

maintenance schedule representing the preferred schedule from the

power plant point of view. In maintenance window, the preferred

schedule is represented by time interval (windows) and the objective

is to minimize the real maintenance cost instead of fictitious cost. In

this paper, we use maintenance window approach.

In order to design an IMS for a practically implementable schedule,

numerous and complex constraints which limit the choice of

scheduling times are incorporated into the solution method. The

constraints which are independent of each other at each time period

are categorized as decoupling constraints and those which are

dependent of each other across the time period are categorized as

coupling constraints.

2.A. Coupling Constraints

The first IMS requirement is that units and lines be overhauled

regularly. This is necessary to keep their efficiency at a reasonable

level, keep the incidence of forced outages low, and prolong the life

of units and lines. This procedure is incorporated periodically by

specifying minimax times that a generating unit may run without

maintenance.

0885-8950/98/$10.00 0 1997 I E E E

The production cost itself is a probabilistic optimization which takes into account the derated capacity of each generating unit. Problem (1) has a natural structure that enables it to be decomposed into a maintenance master problem which is a deterministic integer problem and a set of operation sub-problems which are probabilistic linear programs.. Constraints (iii)-(vi) represent peak load balance. f o r t s e i . the corresponding zt would be the number of maintenance crews in area A and a would be a percentage of this crew required per-line for maintenance of lines k.N k t . . In the case of crew constraint... N ~ ) for 1 crew availability 2. The first term of the objective function (1) is the maintenance cost of generators. 3. Once xit or Nkt variables are fixed. and hence the number of weeks that a machine is “down” is predetermined. The seasonal limitation can be incorporated into e. operational constraints are not completely decoupled since the hydrothermal schedule usually is based on chronological simulation of the generation system. in the vector form is N unit maintenance status. Constraints (i) represent the maintenance window stated in terms of the start of maintenance variables (s. ~ . Set of constraints (ii) consists of crew and resource availability. 3.k {cjt(l-xifj+chf (Nk . 2 and 3 are to be maintained simultaneously. For this case. the resulting operation subproblem can be treated as a set of independent sub-problems. i t vt E vector of the demand in every bus at time t node-branch incidence matrix probabilistic vector that defines the state of the system acceptable level of expected energy not served The unknown variables x j t and N k f in ( 1 ) are restricted to integer values. cp.+d. Decoupling Constraints Network constraints in each time period are considered as decoupling constraints. giI has continuous value. Xit =o for si < t xit E XIt for ei 5 t 5 ii {0. The available crews can be split into geographical and organizational types.1} Nk - N& Nkt = N k ~k~ + di < si + d. The master problem. These constraints also can be applied to generation maintenance. one can determine additional constraints in (1) namely the energy production constraint. The set of operation sub-problems are then solved using the fixed .ek) and their latest period of maintenance (e. generation and transmission outages should also be taken into account (composite reliability evaluation). since there is no constraint across time periods. T maintenance constraints: =1 for t < ei or t 2 I. seasonal limitations 4.1064 The time required for overhaul is generally known. This constraint specifies the minimum number of units necessary to produce a certain amount of energy or to avoid spillage in a hydro plant. Constraint (vii) represents the reliability requirement which takes into account all states of the system. desirable schedule d S p (vii) (1) expected value transmission maintenance cost per-line in right-away k at time t generation maintenance cost for unit i at time t generation cost of unit i at time t number of lines available in right-of-way k at time t . ] i E I ~ ~ c j t ~ j t / S.g.s6 ). the set of constraints may be formed as Omk(’k ekstsi. seasonal limitation. for example that lines 1. The objective of ( 1 ) is to minimize total maintenance and production costs over the operational planning period.. generating and line capacity limits. resources availability > ~ i+dk . 0 if unit is off-line for maintenance maximum number of lines in right-of-away k time period in which maintenance of generating unit i start earliest period for maintenance of generating unit i to begin latest period for maintenance of generating unit i to begin duration of maintenance for generating unit i time period in which maintenance of line k start earliest period for maintenance of line k to begin latest period for maintenance of line k to begin duration of maintenance for line k vector of dummy generators which corresponds to energy not served at time period t maximum line flow capacity in matrix term active power flow in vector term maximum generation capacity in vector term vector of (git) power generation for each unit at time t power generation of unit I at time t - Nkt) Zmt In the case of resource constraints. The unit and the line must be available both before their earliest period of maintenance (e. Mathematically. The problem is decomposed into a master problem and operation sub-problems. the set of constraints be formed as follows: Nli+N2/+N3/ =3 or Nli+N2r+N3t = 0 If we consider that in each maintenance area we have limited resources and crew. l. or line maintenance. In order to avoid over-optimistic planning. one for each time period t. and other constraints such as environmental and fuel constraints. lk ‘+dk’). This master problem is a relaxation of the original problem in that it contains only a subset of constraints. and other operational constraints such as generation and transmission capacity limits in each state. peak load balance equation. is solved to generate a trial solution for maintenance schedule decision variables. on the other hand. The number of crews in each type required at each stage of overhaul of each machine. + d k (ii) system constraints: { E Cr. desirable schedule.’ and l. (9 < t 5 “i. Its optimal value is a lower bound on the optimal value of original problem. or t for Yk E ( o . In hydro plants. It is assumed here that there is little flexibility in manpower usage that varies the time required for maintenance. Constraints (iii)-(vii) may be seen as a probabilistic problem. On the other hand constraints (i)-(ii) may be seen as a deterministic problem. the second is transmission line maintenance cost. the INS can be formulated as follows: I Mn t i. We use transportation model to represent system operation limits. This constraint can be constructed using hydrothermal simulation program I1 41.’ values of constraint (i). which is an integer programming problem. . is specified. only a limited number of machines may be serviced at once due to limited manpower. SOLUTION METHODOLOGY We employ the Benders decomposition. ~ ~ be the amount of resource m available in area A for each time t and c m k would be a percentage of this resource required per-line for maintenance of line k. 2. the network can be modeled as either the transportation model or a linearized power flow model. z ~ would . Therefore (1) corresponds to a mixed-integer programming problem.B. and the third is the energy production cost. If we consider. of the system. Furthermore.

T.B Maintenance Master Problem The maintenance master problem is the minimization of maintenance cost subject to maintenance constraints as well as feasibility and infeasibility cuts from the operation sub-problems. The cost cuts (6) will tend to increase lower bounds obtained from successive maintenance sub-problem solutions.. - = (2) for ei 5 t 2 1. depends on the utilization of available units to satisfy load constraints in each time period subject to maintaining reliability above a certain level. xit or Nkt. . the generation cost in period t can be expressed as SET UP INITIAL MAINTENANCE MASTER PROBLEM 4 The sub-problems may be infeasible due to the fact that the reliability constraints cannot be met. At each iteration the solution of sub-problems generates dual multipliers. we use simultaneous decomposition simulation for all generator and transmission states and intervals [12]. ~ ( c p ) . ‘The IMS must ensure that sufficient reserve exists to provide a secure supply while minimizing the cost of operation. is the solution of feasibility check in its associated state space. 1 may be interpreted as the marginal The multiplier decrease in energy not supplied with a 1 MW increase in either generators or transmission lines available capacity. Thus. 4 and . The procedure is as follows: 1. Maintenance Scheduling Decomposition The initial maintenance master problem is formulated as follow: z Min maintenance constraints X-t =1 Xit Xit for si 5 t 5 si + di =o E {0. w. given the nthtrial maintenance schedule.! - Nkt E(O. Select a system state cp. 4. These dual multipliers are used to form one or more constraints (known as cuts) which are added to the master problem for the next iteration. Nkt < ‘k Nkt where w: is the expected fuel cost for period t associated with the n* for t < e i or t > l i + d i for si Nk < t 5 4 + d. < f < $ 1.A Operation Sub-problems The operation cost is the direct cost associated with load supply. etc. given the n* iteration of maintenance schedule. If all sub-problems are feasible. 3.. which measure the change in either production cost or reliability resulting from marginal changes in the maintenance schedule. The reliability level. seasonal limitations 4. crew availability 2. verify whether that specific configuration of generators and transmission lines is able to supply that specific load without violating system limits.. The calculation of (3) and (5) involve the reliability evaluation of a composite system. Before minimizing the operation cost. or I > li. since knowing which generator and transmissions are available during period t allows us to minimize the expected operation cost. then an infeasibility cut is generated.T S f + g + r = d ( p ) +oN p~ The solution of the sub-problem is not complicated. we check the feasibility of the sub-problem as Min S.. Le. equipment availability.. Calculate (3) or (5) for the selected state. The infeasibility cut is SOLVE THE MAINTENANCE MASTER PROBLEM I ’FEASIBLE ~ 7 S..1) fort s e i .1065 maintenance schedule obtained from the solution of the maiiter problem. resources availability 3. +di. as shown in Figure 1. then the fuel cost for period t. which are not possible to be scheduled. Return to step 1 if the accuracy is unacceptable... Sf+ g+ r = d ( p ) g <g(q). desirable schedule 3. 3. 2. If all of operation sub-problems are feasible then their solution yield a set of dual multipliers from which a feasibility cut is constructed.I . If one or more of sub-problems are infeasible. The infeasibility cuts (4) will eliminate maintenance values. N k ) f O r e . Update the estimated production cost or load shedding expectation. Le.xn (dual variable is A) d(9) r 1 If 5 f(p). The multiplier z. In order to allow a fast algorithm and efficient calculations. define load levels. If one or more of operation sub-problems are infeasible then for each infeasible sub-problem an infeasibility cut is generated. The process continues until a feasible solution is found whose cost is sufficiently close to lower bound. the cut is associated with a deterministic instead of probabilistic operation sub-problem. For each infeasible sub-problem resulting from the nthsolution of the master problem. The feasible cut is of the form Figure 1.yand zkymay be interpreted as expected marginal costs associated with 1 MW decrease in the power capacity. trial solution. N n (dual variable is A’) where x*and Nnrepresent the trial solution of the master problem at iteration n. operating conditions.

0.5* ( l .. 5 . in this sample study.k cit (1 . < 2*0.)+200*(1-~2)+ S.<2 x.5 o<g.~ z + ) 0. The critical point in the decomposition is the modification of objective function based on the solution of operation sub-problem...= 1 x. + r I =I -h. Loads are assumed constant during the study period.5 0.+N.=O N..=2 N.1066 Min Table 2.4 2 2 2 f o r t S e i or t 2 l i + d i - if all subproblems are feasible then the feasibilty cut is: (7) if one or more subproblems are infeasible then the infeasiblity cut is: infeasible subproblem Min S. setting A to 1% is good enough. 100*(2. An are multiplier vectors at the nth iteration The important feature of the Bender decomposition is the availability of upper and lower bounds to the optimal solution at each iteration. These multipliers are used to form a linear constraint. +A2+ g2 + r2 = 3 n 100 200 300 Max Capacity/line (P. N ~ fore. From our experience.285 0.85 The dual price of the operation sub-problem: generator: h.<2 N.T Yl+r2+r3 xg E 0.)+ 300*(2-N.. all lines are assumed to be perfectly reliable. 4 x.=O ~ 3 0 0 Then.95*0. The infeasible cut is as follows: 0.i 0 -2*0.~. The forced outrage rate (FOR) of each generator is given in Table 2..= 0.)+ 300*(1.) +0.5.Nl.=O N. Feasibility Check State Spaces There is a trade-off between A and number of iteration..=2 x. = 0.x?)< 0.95 I. the feasibility check gives E{r}=0..<I x. line and load input data in per unit are given in Tables 1. For convenience. Table 5.5 ij 2 .95*0.6 for s.=2 N.NL2)+ 100*(1-x. The first state soace formulation of feasibility check is as follows N<N .=l x..n Maint.Xjt) + c i t ( z k - Nki)] 11 maintenance constraints : for t < ei or t t li + di for si < t < si + di Xjt = 1 Xit = 0 zit E for ei 5 t 5 li {0. Generator Data h i t I Min Canacitv IMax Caoacitv I Operation I Maint. =O h.+N. < 2.. The smaller the A the larger the number of iteration. written in terms of maintenance variable x..9*2. . = 0.5 (2.=2 xI= 1 x.5 The solution is: N. known as Benders cut.<t<l.4225 which is less than ~ = 0 . 1 where: n is the current number of iterations. we solve the initial maintenance master problem: Min z 200*(2-N2.25 .The primal solution for all state spaces of feasible sub-problem can be seen in Table 5.5 The solution of the maintenance master problem for the second iteration is: N. seasonal iimitations 4 desirable schedule 2 resources availability N~~ E(o.I 1 crew availability e Line Wline # of lines 1-2 2-3 1-3 (P.=O z=500 Given the trial maintenance schedule from iteration 2.. + d..<o 05f.T.NIJ +0.1 0.< 1 x. A. The generator.045 0.= 0 I. 5 2 N.+x2+x.u.5 0..98 power flow: hf.) < z N. Table 4.25 0. +h3+g3+ r?=I z .1 0.<l feasibility and infeasibility cuts from previous iterations Vl E 100 0.. + g... Associated with the solution of the operation sub-problem is a set of dual multipliers which measure changes in system operating costs caused by marginal changes in the trial maintenance.005 0. These bounds can be used as an effective convergence criterion.Cost ($/line) First..5 -2*0.2 0.9 I.= 0..U.U. we check the feasibility of operation sub-problem given the first trial of maintenance schedule. The system reliability requirement ( E ) is 0. < 2.Cost/Unit IFOR z t i.2.6 < g. The convergence criterion is 2(W-Z) (8) (W+Z) Load balance at bus 1 Load balance at bus 2 Load balance at bus 3 Generator 1 limit Generator 2 limit Generator 3 limit Line 1-2 flow limit Line 1-3 flow limit Line 2-3 flow limit -&-A. The problem is defined as: We are to perform maintenance on at least 2 lines and one generator within the study period. This constraint. Feasible Sub-txoblem State Soaces I Table 1. < t < s.. A"'.095 0.5 0.025 E{r)=O.=l x..5 p. 4. For some cases the problem may not converge if the A is too small.5 <Ai< 2*0.11 Nkt < '-k Nkt N k 0.5 < g ..85 + 0..i ) 3.1125 0. zr ...<2 N. Bus data g3 w =546.The cost is set arbitrarily to w=1000 because the solution is infeasible.98*3* ( 0 .95 The above LP solution is infeasible. since E{r]+r2+r3}>0. We assume the study period has only one time interval.5 The primal solution for all state spaces in the feasibility check are given in Table 4.5 (0. and 3. is returned to the maintenance problem which is modified and solved again to determine a new trial maintenance plan. EXAMPLE We use a three-bus system as an example.

19. The corresponding line maintenance schedule and generator loading points of the weekly load are shown in Tables 10 and 11 respectively. the 12-week horizon is between 18-29.22-29 I 18-22.=2 x!= I n2=l x. Table 7. During the tkreemonth period. In the first iteration.)-9*2. The maximum transmission flow over the three-month study period is shown in Table 9.00/MBtu for Oil #2.25.Z/MBtu for coal and $2. is considered.3/MBtu for Oil #6. Table 6. For Case 0. are expected to be maintained. Generating Units Considered Table 7 gives the operating characteristics of the generating uni'ts in this area. In these tables.5*( 1-~. Unit 5 is not used in all time periods.24 2 1. the problem is the classical unit maintenance scheduling. weeks up and down in Table I O refer to periods in which units are used for supplying the load.5*(1-~2) The solution of the maintenance master problem for the third iteration is: Ni2=2 N2?=0 N. Transmission limits also affect the maintenance schedule (Unit 2 starting on the week of maintenance.19. In iteration two. sub-problems are feasible and the final cost is given in Table 8. &=I% of load ) 2 1 36.ion facilities in a particular area need maintenance within the study period.9 18-29 0.29 18.)+ 300*(1.23.24 Maintenance 4-9 6-10 2-4 5-10 4-9 3 -9 Weeks Down 28 23 29 19 18-21.23-29 20-29 18.)+546.23 23. transmission limits are imposed on the optimization problem.21 23. (Unit 5 in Case 2. The coverage of area includes buses 1 through 10.xi)+ 200*(1-~2)+ 100*(1-~.19 26. Overflow on Transmission Lines (12-week horizon. Case 1 does not impose any transmission limits.21 27.25. Here. Table 10).CASE STUDY We apply the proposed method to the IEEE-RTS [I I].29 18.24-29 I 20. A three-month study period of summer weeks.21-24 18-22.0 I 5.19. 23 buses and 38 transmission lines. at least 4 transmission lines in this area.E$ 22. Weeks on Maintenance 24. [r Size 1 Fuel I Heat Ratel 1 MW I 1 I 20 76 100 1 I I I 1 I I I Case I I 1 I Ia I I O Unit l l 1 1 5 1 I l l 1 34 2 5 Table 8.. indicating a shift from units that use inexpensive fuel to those with more expensive fuels and inefficient units.68846 36.19. This system is made o f 32 generating units.22-29 22. The imposed transmission limits increase the cost of operation.5 ICg2 = -9 xg3 =0 power flow: nfi2=0 xns= 0 =fii= 0 The feasible cut for the second iteration is: z >100*(2. The average fuel price is $3.29 18.27 20. 20 demand sides.25-29 18-20.29 .24.28 I buses 1-2 5-10 Weeks Up 18-23. Case 0 is converged in two iterations.1067 The dual price of the operation subproblem is: generator: ngi= -9. and the scheduling of inefficient unit for on-line duty.22 18.5*2. Details of transmission line characteristics can be found in [I 11.69147 In Case 0 with no network constraints. Cases 1 and 2).25-29 18-27 20-29 18.19 20.29 23. $I. Table 9.0 I 18-29 I 2 Coal 12000 760. ~ = l % of load ) 5. O&M Cost of Generating Unit (12-week horizon.( (week) Oil #2 14500 I 6.0 0.8 18-29 10000 850.24 28.25 27. Generating Units Operating Cost Data O&M Cost I Maintenan<= Btu/kWh Fixed I Variable\ Window I D u r z a I 103$/Yr. the sub-problems are infeasible in all peiiods.28 . In Case 2.. Table 6 gives the generating units which are to be maintained.N12)+200*(2-N23)+ 300*(2-N.=O ~ 5 4 25 6 We stop here since FW which means the cost is equal to the lower bound.26. Some generation and transmis:. $/kWNr. weeks 18-29.28.25-9.28.26-29 18-26.25-29 18-22. Table 8 shows the change in operating cost over the study period. power flow in each line except for lines 1-3 and 11-14 is within limits for most periods.0 Oil#6 Cases 1 and 2 study the effect of transmission limits on maintenance schedule.

pp. Presently. Vol.12 1 3. PAS-104.H. “Adjusting Maintenance Schedules to Levelize Risk. “A Decomposition Approach to Unit Maintenance Scheduling. SMC-6. 3. Lasdon. Toyoda. No. 1979. Nov. Table 12. et al. G. 8 J. maintenance of unit 1 is shifted from weeks 23-24 to weeks 34-35. Chen. 11. . Vol. on Power Apparatus and Systems. Quintana.” IEEE Trans. Vol. Maintenance 4-9 3-9 2. Singh.” IEEE Trans. Zurn. Egan. May 1995. Jan. Vol. ~ = l % of load ) Maintenance 5. and the Agency for the Assessment & Application of Technology (BPPT). 1985. 1970. on Power Apparatus and Systems.T. 1-2 and 1-5 affects the output of units. 1537-1545.. Garver. PAS-91.695-701. T. Christiaanse.M. pp. 7. Vol. S. 30743080. pp.. on Power Apparatus and Systems. Hara.K. H. Vol. on Power Apparatus and Systems.427-436. units are loaded in decreasing order of operating costs. “Generator Maintenance Scheduling via Successive Approximation Dynamic Programming.M. 734-743. he is completing his Ph.H. “A Method for Planning Economic Unit Commitment and Maintenance of Thermal Power Systems. Dr. Lemonidis. The test results demonstrate that the limits on transmission line capacity affect the loading of units and increase the generation by expensive and inefficient units. 9 M./Feb. the cost can be reduced as seen in Table 14 and a better distribution of risk can be achieved. O&M Cost of Generating Unit Case I Cost (IO6$) 12-week I 36. Le. 6. Vol.” IEEE Trans. No. pp. PAS-91.” IEEE Trans. REFERENCES 1. No. PAS-98. Honda. 7. &=I% of load Table 13. 2. IO. weeks 18-19 to 11-12. Vol 10. AI-Khamis. 84100.” Operation Research. “Optimal Generator Maintenance Scheduling Using Integer Programming. Reliability Test System Task Force of the Application of Probability Methods Subcommittee. No. on Power Systems.. on Power System. Shahidehpour is a professor in the ECE Department and Dean of Graduate College at Illinois Institute of Technology. No. 11. 2057-2063. J. May 1966. S. March/April 1975. on Man.1068 In practice.” IEEE Trans.2. May 1992.” IEEE Trans. This in turn increases the unit operating cost affecting the loading of units as shown in Table 10. New York. pp. 14. 6. “Transmission Constrained Maintenance Scheduling of Generating Units: A Stochastic Programming Approach. Indonesia. Pereira et al.” IEEE Trans. L. “Decomposition Approach to Automated Generation /Transmission Expansion Planning. ACKNOWLEDGMENTS The authors would like to appreciate the financial support provided by the Power Systems Laboratory at Illinois Institute of ’Technology. 1 6. Deng. 1983. W. he has been with The Ministry o f Research and Technology Republic of Indonesia. Yellen. Vol. Also units 2. ” IEEE Trans. 726-733.S.69147 52-week 36. T./Oct.M. No.F. No. With transmission limits. pp. 13 L. L. PAS-94. 31.D. Since units and lines are not forced to be maintained within 12 weeks. loading of all units is affected and the inefficient unit 5 has to be brought on-line for weeks 23 and 24 to supply generation deficit. Marwali received his BS degrees in electrical engineering from Bandung Institute of Technology. 1. No. With transmission limitations. on Power Apparatus and Systems. Vol. 538-547. Nov. at Illinois Institute of Technology.PAS-85. Limiting lines 1-3. L. No. Generating Unit Maintenance in Case 2 (52-week horizon. E./Oct. Z. “Optimal Generating Unit Maintenance Scheduling for Multi-area System with Network Constraints. 4 and 5 are shifted from weeks 27-28 to weeks 38-39. pp. 1972. pp. Aug. available units in one time period may become less attractive as compared to those in some other time periods when availability is even more crucial./Feb. Jan. on Power Apparatus and Systems. ” IEEE Trans. BIOGRAPHIES M. J. 1. Indonesia. Palmer. pp. on Power Systems. K.67934 I 4. V. in 1989 and MS from IIT in 1994. No. CONCLUSIONS This paper presents a decomposition approach based on the duality theory for generationitransmission maintenance scheduling with network constraints. pp. PAS-94. “Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders Decomposition. pp. M. 1168-1 174.Vemuri. Dillon. 1991. 1. 5 . No. Transmission Maintenance Schedule in Case 2 (52-week horizon. 2.R. H. Vol. 38. additional complex constraints are imposed on the maintenance scheduling problem.Kimura. “A Technique for the automated Scheduling of the Maintenance of Generating Facilities. “IEEE Reliability Test System. The test system was applied over a year-long horizon of 52 weeks Tables 12 and 13 show the maintenance schedule for generating units and transmission lines respectively. 6. pp. 2047-2054.H. Dopazo. which in turn affects the loading of unit 2. 12. MacMillan.” IEEE Trans. 1976. Sept. “A New Approach to Reliability Evaluation of Interconnected Power Systems Including Planned Outage and Frequency Calculations. 5. Sept. 8. Using the proposed decomposition method. 665-671. resulting in an increase in the overall cost of operation. 7. weeks 20-21 to 12-13. A.L. J. Bloom. Morsztyn. C. Optimization Theory for Large Systems./Dec.39 11. and weeks 27-28 to 38-39 respectively. Silva.C. K. Vol. No.F. May 1992. on Power Apparatus and Systems. Since 1989. N. pp.L. 137-144.” IEEE Trans.5. Merrill. Vol. 1975. “An Experimental Method of Determination of Optimal Maintenance Schedules in Power systems Using the Branch and Bound Techniques. Shahidehpour is a member of the Technical Committee of PICA and serves on the Board of Directors of HKN.” IEEE Trans. and Cybernetics. The units and lines maintenance schedule are shifted to lower peak loads.V. The extension of the generation maintenance scheduling to include transmission maintenance and network constraints is applicable to the problem of maintenance with probabilistic data. 36 Table 14. 1972. on Power Systems.

- Mathematical Modeling of Production Scheduling Problem: A Case Study for Manufacturing IndustryCargado porIJSTE
- Joseph J. Moder, Cecil R. Phillips, Edward W. Davis-Project Management With Cpm, Pert and Precedence Diagramming-Van Nostrand Reinhold (1983)Cargado porEdgar Agus
- Operations ManagementCargado porfrancis
- E48797_01Cargado porbaluanne
- Layout and FlowCargado porJeevanNair
- Design Flow ShopCargado porAbby Dalag
- 12_1_APS-ASCP_B31553_04Cargado por邢玉蓮
- optimizacion PCB AssemblyCargado porJesus El Chino
- A New Continuous-time Formulation for Scheduling Crude Oil OperationsCargado porsaeid063
- MS ProjectCargado porvermaroyal
- Multiprocessor SchedulingCargado porusmani.yusuf
- SAP+PPPI+Process+Order+CreationCargado porShashank Mani Tripathi
- 11- Space FrameCargado porhari1008108
- Lecture Note 1Cargado porPawan Aichra
- Predictive Control for Tight Group Formation of Multi-Agent SystemsCargado porjejudo
- SAP OptimizationCargado pormanish1612
- Integer ProgrammingCargado porDamar Saloka A
- Chap 07 LP Models Graphical and Computer Methods SoanCargado porNguyên Bùi
- Lyamin y Sloan, 2002a.pdfCargado porMarco Antonio Serrano Ortega
- om quizCargado porSyed Qutubuddin
- Conference Paper on LP Appln in Power PlantCargado porNilakantan N Sundararaman
- WE_M9Cargado porVIPUL Atpadkar
- Complete BookCargado porChandan Chowdhury
- AOR (Lecture 1) Part 1-1Cargado porsyed
- Operational Reasearch TechniquesCargado porAYENIGBA SOGO EMMANUEL