Volume 29, Issue 3 (IJIEPR 2018)                   IJIEPR 2018, 29(3): 293-320 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Noori S, Taghizadeh K. Multi-mode resource constrained project scheduling problem: a survey of variants, extensions, and methods. IJIEPR 2018; 29 (3) :293-320
URL: http://ijiepr.iust.ac.ir/article-1-787-en.html
1- Department of Industrial Engineering, Iran University of Science and Technology, Narmak Avenue, 16846-13114, Tehran, Iran, , snoori@iust.ac.ir
2- Department of Industrial Engineering, Iran University of Science and Technology, Narmak Avenue, 16846-13114, Tehran, Iran,
Abstract:   (4275 Views)
The Multi-Mode Resource Constrained Project Scheduling Problem (MMRCPSP) is one of the most important problems in project scheduling context. The MMRCPSP consists of activities to be scheduled subject to precedence and resource constraints. The effort needed in order to accomplish activities in the MMRCPSP is a discrete function of job performing modes. However, MMRCPSP is a basic model with a rather too restrictive assumptions to be applied practically. Therefore, there are many extensions over basic MMRCPSP model in terms of objective functions, resource constraints, and solving procedures. This research is aiming at fulfilling tow ambitions. First, to collect researches related MMRCPSP and to classify them based on a framework consisting of six distinct classes. Second, to indicate current trends and potential areas of future research. In order to fulfill the second goal a new mathematical method is proposed and applied which identify recent trends and gaps in a systematic manner.
 
Full-Text [PDF 1017 kb]   (3940 Downloads)    
Type of Study: Research | Subject: Project Control
Received: 2017/09/16 | Accepted: 2018/08/4 | Published: 2018/09/23

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.