Parallel implementation of the unit commitment problem on NOWs

This paper proposes the application of parallelization techniques for solving the unit commitment problem (UCP) on NOWs (networks of workstations). A modified parallel dynamic programming method that takes advantage of NOWs is presented. Our algorithm performs better than the general parallel dynamic programming algorithm for UCP. In order to demonstrate the usefulness of our technique, we apply our parallel programs in some case studies. Studies reveal that our parallel dynamic programming algorithm has the potential to enhance the dynamic control of unit commitment in real time situations.