Resumen de A State Space Approach for Solving Project Scheduling Problems
The propose a state space approach for representing project scheduling problems with resource constraints. This state space representation will enable the applications of many currently available state space based heuristic research methods. We apply an admissible heuristic search method to demonstrate the application process in finding the optimal schedule. In formulating a project scheduling problem into a state space problem we base on the dynamic nature of the resource availability of project scheduling operations to define estates state transition operator, and state transition costs. We also utilize the inherent network features of the project scheduling problems to suggest ways to obtain good initial heuristic estimates to facilitate the applications of heuristic search methods.
