The application of an admissible heuristic algorithm to project scheduling problem
by Reza Zamani, Li-Yen Shue
International Journal of Computer Applications in Technology (IJCAT), Vol. 10, No. 5/6, 1997

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.

Online publication date: Mon, 02-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com