The design of an activity buffer that minimises project delay
by Chiou-Shuei Wei; Chiu-Chi Wei; Suz-Tsung Wei
International Journal of Industrial and Systems Engineering (IJISE), Vol. 24, No. 4, 2016

Abstract: The theory of constraint (TOC) has long been applied to planning project schedules, and critical chain and buffer management are both developed to reduce the impact of future project uncertainties. Several models are proposed for the project activity buffers, including: 1) the cut and paste method proposed by Goldratt, in 1997; 2) the square root error method proposed by Newbold, in 1998; 3) the adaptive procedure with density proposed by Tukel in 2005. This study proposes a multi-objective mathematical programming model that enables project managers to concurrently maximise the on time delivery of project activities. The multi-objective model is consolidated into a single-objective programming model using a fuzzy membership function. Maximising the value of this membership function leads to the maximisation of the probability of on time completion for all project activities. The model is applied to a real case and the result shows that the proposed fuzzy model determines the duration of activities, which ensures that a project can be completed with the highest probability compared to other methods.

Online publication date: Fri, 11-Nov-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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