A new heuristic solution method in resource constrained project scheduling

A new heuristic solution method in resource constrained project scheduling

0.00 Avg rating0 Votes
Article ID: iaor19911564
Country: United States
Volume: 38
Issue: 3
Start Page Number: 315
End Page Number: 331
Publication Date: Jun 1991
Journal: Naval Research Logistics
Authors: ,
Abstract:

A new heuristic method is presented for the resolution of multiresource constrained conflicts in project scheduling. In attempting to find a minimal makespan solution, the algorithm employs a simple procedure to generate a feasible solution with no backtracking. A postanalysis phase then applies a hill-climbing search. The solution method is different from existing heuristic methods in that it repairs resource conflicts rather than constructs detailed schedules by dispatching activities. Resource-violating sets of activities are identified which must be prevented from concurrent execution because this would violate resource constraints. Repairs are made by imposing an arc to sequence two activities in such a resource violating set. Computational results are compared with those of existing heuristics for the minimal makespan problem.

Reviews

Required fields are marked *. Your email address will not be published.