A new heuristic solution method in resource-constrained project scheduling

✍ Scribed by Colin E. Bell; Jaemin Han

• Publisher: John Wiley and Sons
• Year: 1991
• Tongue: English
• Weight: 979 KB
• Volume: 38
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/1520-6750(199106)38:3<315::aid-nav3220380304>3.0.co;2-7

✦ Synopsis

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. Resourceviolating 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.