Optimal generator maintenance scheduling using integer programming

The generator maintenance scheduling problem is formulated as a 0-1 integer linear program. Although previous papers have considered a rigorous integer programming approach intractable, an algorithm of this type is developed which (1) is guaranteed to find a schedule satisfying problem constraints, if one exists; (2) is guaranteed to find the optimal feasible schedules; and (3) will accept any of an important class of optimality criteria, not just levelness of reserve. Particular attention is directed to a new criterion incorporating dollar costs/benefits incurred by delaying or advancing maintenance on a unit.