Project Scheduling with Resource Constraints Using Branch and Bound Methods

The problem of minimising the overall duration of a project subject to constraints on the availability of resources is considered with particular reference to the use of branch and bound methods. A new resource based bound, new dominance rules and an innovatory network breakdown technique which preserves optimality are reported. Computational experience and comparisons with schedules obtained by decision rule methods are given.