Please use this identifier to cite or link to this item:
Ortiz-Pimiento, Nestor Raul
Diaz-Serna, Francisco Javier
Year of Publication: 
[Journal:] Journal of Industrial Engineering and Management (JIEM) [ISSN:] 2013-0953 [Volume:] 11 [Year:] 2018 [Issue:] 1 [Pages:] 116-134
Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with non-deterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.
project scheduling
random duration
uncertain duration
stochastic duration
task duration
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 
Social Media Mentions:

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.