Article ID: | iaor1993512 |
Country: | Netherlands |
Volume: | 51 |
Issue: | 1 |
Start Page Number: | 110 |
End Page Number: | 118 |
Publication Date: | Mar 1991 |
Journal: | European Journal of Operational Research |
Authors: | Deckro Richard F., Hebert John E., Winkofsky E.P., Gagnon Roger |
Keywords: | programming: integer |
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.