TY - JOUR
T1 - Non-delay scheduling as a managerial approach for managing projects
AU - Zwikael, Ofer
AU - Cohen, Yuval
AU - Sadeh, Arik
PY - 2006/5
Y1 - 2006/5
N2 - Many project managers face the dilemma of using delay versus non-delay scheduling while planning and managing a project. The first approach is called a non-delay schedule, also known as the "early start" or "as soon as possible" approach. The second approach, called a "delay schedule", based on "late start" scheduling, has recently been connected to some new models, among them, the Theory of Constraints. The paper compares these two approaches for managing projects. The non-delay concept was found to be more efficient in reducing project risk, reducing project duration, improving resource load, improving project tram development and improving the positioning of a project manager while negotiating for resources. However, some limitations in existing non-delay models were found and hence, a new non-delay scheduling algorithm was developed and is introduced in this paper. Comparing this model with other models from the literature, it was found that the suggested one gives better results while considering measures of computing time and project duration.
AB - Many project managers face the dilemma of using delay versus non-delay scheduling while planning and managing a project. The first approach is called a non-delay schedule, also known as the "early start" or "as soon as possible" approach. The second approach, called a "delay schedule", based on "late start" scheduling, has recently been connected to some new models, among them, the Theory of Constraints. The paper compares these two approaches for managing projects. The non-delay concept was found to be more efficient in reducing project risk, reducing project duration, improving resource load, improving project tram development and improving the positioning of a project manager while negotiating for resources. However, some limitations in existing non-delay models were found and hence, a new non-delay scheduling algorithm was developed and is introduced in this paper. Comparing this model with other models from the literature, it was found that the suggested one gives better results while considering measures of computing time and project duration.
KW - Branch and bound
KW - Managing projects
KW - Non-delay scheduling
KW - Resource constraints
KW - Theory of constraints
KW - Time
UR - http://www.scopus.com/inward/record.url?scp=33645966496&partnerID=8YFLogxK
U2 - 10.1016/j.ijproman.2005.11.002
DO - 10.1016/j.ijproman.2005.11.002
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33645966496
SN - 0263-7863
VL - 24
SP - 330
EP - 336
JO - International Journal of Project Management
JF - International Journal of Project Management
IS - 4
ER -