Network‐based project planning and scheduling

Homayoun Khamooshi (Senior Lecturer, Faculty of Management and Business, Nene College of Higher Education, Northampton, UK)

Industrial Management & Data Systems

ISSN: 0263-5577

Publication date: 1 December 1996


Discusses the twofold purpose of this study, first to introduce a number of measures devised to be used in comparing and evaluating two schedules for the same project, second to present and evaluate a heuristic procedure developed in this research for solving the resource constrained project scheduling problem. Posits that the new procedure is based on the notion that a project can be partitioned into a number of sections and there is no obligation to use a single policy all the way through all the sections of project. Shows that this research is also an attempt to bridge the gap between the theory and practice by eliminating the question of which priority rule to use for which project. Develops a new model showing that selecting from a number of priority rules is not required and, using the measures of performance introduced, decides on a suitable schedule from the schedules produced under varied assumptions is shown to be much easier. Concludes with suggestions for further research.



Khamooshi, H. (1996), "Network‐based project planning and scheduling", Industrial Management & Data Systems, Vol. 96 No. 8, pp. 13-22.

Download as .RIS




Copyright © 1996, MCB UP Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.