By Topic

Project-Scheduling Problem With Random Time-Dependent Activity Duration Times

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei Huang ; State Key Lab. of Software Eng., Wuhan Univ., Wuhan, China ; Lixin Ding

In this paper, we introduce a random time-dependent project -scheduling problem (RTPSP), in which activity duration times are represented as randomness as well as time dependence. Under these circumstances, the resulting RTPSP is far more complex when compared with existing project-scheduling problems. The complexity stems identifying the critical path, a core issue when dealing with project-scheduling problems. Considering the critical path, we first show that using “standard” path algorithms (e.g., the well-known Dijkstra method) are not able to arrive at solutions. Subsequently, we propose an approach of handling the critical path of RTPSP. Next, we formulate the RTPSP and present three stochastic-programming models to address various requirements arising within this framework. The proposed models are handled through techniques that combine mechanisms of stochastic simulation and genetic optimization. Stochastic simulation is exploited here to estimate the value of uncertain functions that do not exist in the general project-scheduling problems. Numerical experiments are used to illustrate the effectiveness of the algorithm.

Published in:

Engineering Management, IEEE Transactions on  (Volume:58 ,  Issue: 2 )