Time-cost trade-off resource-constrained project scheduling problem with stochastic duration and time crashing Online publication date: Tue, 02-Oct-2018
by Zhe Zhang; Xuejuan Zhong
International Journal of Applied Decision Sciences (IJADS), Vol. 11, No. 4, 2018
Abstract: In this paper, time crashing is implemented to solve the limitation of buffer insertion when consider the high variability of activities and resources in resource constrained project scheduling problem (RCPSP). The activity duration and resource are considered to be beta and exponential distributed, respectively. To settle the discrete time-cost trade off problem, a nonlinear combinatorial optimisation model is developed to pursuing the time, cost and robustness of the project. Six improvement principles are proposed and three balance points are discovered according to the different situations in the time-cost trade-off process, in which the earliness bonus, tardiness penalty, instability cost and time crashing cost are involved. To minimise total budget of the project, tabu search and starting time criticality heuristic is designed as the solution method. Finally, a numerical example is presented to highlight the efficiency of proposed model and solution method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook