Abstract
A fractional cutting plane / branch & bound (FCPA / B & B) algorithm is developed for maintenance scheduling of power generating facilities. We give an integer programming problem formulation of the maintenance scheduling. We derive a class of valid inequalities and show two approximate algorithms for the separation problem of the proposed family of valid inequalities. Finally we demonstrate computational results of our algorithm.
