A DECOMPOSITION APPROACH TO MULTI-PROJECT SCHEDULING

This paper develops the use of a decomposition algorithm in solving a resource limited, multi-project scheduling problem. The decomposition approach offers two distinct advantages over a direct optimization approach: (1) the ability to realistically solve large problems, and (2) the option of using the decomposition approach as a heuristic. This approach provides a performance measure on all feasible solutions, allowing the user to decide if further calculation expense is warranted in view of the absolute potential gain in the incumbent solution value.