Authors: Reza Zamani, Li-Yen Shue
Addresses: Department of Business Systems, University of Wollongong, 2500, Australia. ' Department of Business Systems, University of Wollongong, 2500, Australia
Abstract: We present an admissible heuristic search algorithm and apply it to solve the project scheduling problems with resource constraints. This algorithm is characterized by its heuristic learning, and through the forward search and backward review strategy the search path can always represent the best path which can be found with the known heuristic estimates at any moment. When the goal state is reached, the search path itself is an optimal solution. In order to implement this algorithm to solve the project scheduling problems with resource constraints, we base on the dynamic nature of resources to define states, state transition operator, and the cost of transition between states. The detailed implementation procedures are demonstrated through an example.
Keywords: project scheduling; heuristic search; admissible heuristics; resource constraints.
International Journal of Computer Applications in Technology, 1997 Vol.10 No.5/6, pp.308 - 315
Published online: 02 Jun 2014 *Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article