An Exact Bidirectional Approach to the Resource Constrained Project Scheduling Problem
Year: 2002
Type: article
Abstract: A new bidirectional shortest path approach to the Resource Constrained Project Scheduling Problem is discussed. The approach is based on Dijkstra's Shortest Path algorithm and consists of iteratively generating reduced forward and reverse state networks until an optimal termination criterion is reached. The general principles that make the approach workable are examined.
Author: Razek E. Karnoub
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W89202375
