Abstract
This paper deals with the problem of scheduling activities of multiple projects when there is constraint on available resources. At the present time the general problem of multi-project resource allocation is formulated as a zero-one programming and goal programming models. But the problem of determining a schedule subject to precedence and resource constraints is difficult to solve. It would be even more complex when unforeseen changes are considered, for example in the level of resources. Therefore, the scheduling problem is decomposed into a series of multidimensional knapsack problem, and a heuristic procedure is proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
