A Method for Multi-project with Resource Constraints Based on Greedy Strategy

Author

Liu, Haibin ; Wang, Yanbing

Author_Institution

China Aerosp. Eng. Consultation Center, Beijing

fYear

2009

Firstpage

22

Lastpage

27

Abstract

Resource conflict is an outstanding problem in concurrent multiple projects with sharing a common and limited resource pool, and it often results in lower performance of these projects. Therefore, it is important and urgent to find an effective method for scheduling multiple projects with limited resources. A mathematical model for the multi-project scheduling problem with resource-constrained is proposed, and a scheduling algorithm based on greedy strategy for the problem is analyzed. Its application in real projects and comparison with other scheduling schemes proves that the algorithm is feasible.

Keywords

greedy algorithms; project management; resource allocation; scheduling; greedy strategy; mathematical model; multiple project scheduling; resource conflict; resource constraint; Aerospace engineering; Algorithm design and analysis; Genetic algorithms; Heuristic algorithms; Iterative algorithms; Job shop scheduling; Mathematical model; Resource management; Sampling methods; Scheduling algorithm; greedy strategy; multi-projects scheduling; resource allocation; resource constraints;

fLanguage

English

Publisher

ieee

Conference_Titel

Autonomic and Autonomous Systems, 2009. ICAS '09. Fifth International Conference on

Conference_Location

Valencia

Print_ISBN

978-1-4244-3684-2

Electronic_ISBN

978-0-7695-3584-5

Type

conf

DOI

10.1109/ICAS.2009.9

Filename

4976575