Model and algorithm for human resource-constrained R&D program scheduling optimization

10Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In resource-constrained project scheduling problems, renewable resources can be expanded into human resources with competency differences. A flexible resource-constrained project scheduling problem with competency differences is proposed, which is a practical extension close to Research and Development (R&D) program management, from the traditional multimode resource-constrained project scheduling problem. A parameter and estimation formula to measure staff competency is presented, and a mixed-integer programming model is established for the problem. The single-objective optimization problems of optimal duration and optimal cost are solved sequentially according to the biobjective importance. To solve the model, according to the assumptions and constraints of the model, the initial network diagram of multiple projects is determined, the enumeration algorithm satisfying constraint conditions provides the feasible solution sets, and the algorithm based on dynamic programming is designed for phased optimization. Experimental results show that the proposed optimization model considering competence differences can solve the problem effectively.

Cite

CITATION STYLE

APA

Chen, J., Tong, S., Xie, H., Nie, Y., & Zhang, J. (2019). Model and algorithm for human resource-constrained R&D program scheduling optimization. Discrete Dynamics in Nature and Society, 2019. https://doi.org/10.1155/2019/2320632

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free