Sadeh, A.; Cohen, Y; Zwikael, Ofer
There is a steadily increase in the size and complexity of projects. As a result, traditional project scheduling techniques, such as non-polynomial (NP) algorithms can no longer provide an optimal solution to minimum project duration under predecessors and resource constraints.. This paper presents for the first time a general new approach that allows utilizing such algorithms in heuristic manner. This approach could be efficiently applied for solving most project scheduling problems. The main...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.