Setting due dates for computer based system development projects
Douglas B. Bock · Medical Entomology and Zoology · 1987
This research examines a heuristic, rule-based approach to the estimation of project due dates in Management Information System (MIS) departments. Due date estimation for computer based system development projects may be described as a multi-project, capacitated, multi-resource, dynamic, preemptive problem. Multiple projects compete for several classes of limited resources. The dynamic, continual arrival of new projects results in the preemption of resources due to project priority policies. In this dynamic environment, the estimation of accurate project due dates is a difficult and challenging problem. The research is conducted in two phases. The objective of the first phase is the derivation of a model of computer based systems development for MIS departments using a life cycle development methodology. A series of field interviews are conducted with project managers and their supervisors from a convenience sample of eight MIS departments. The interviews are used to validate a general MIS department model. This model is used as the basis for the second phase of the research. In Phase 2, a three-factor, full-factorial computer simulation experiment is conducted to test the relative effectiveness of combinations of due date setting, resource scheduling, and resource preemption heuristics. The due date and resource scheduling rules selected were previously examined in a general multi-project management environment. This research examines their effectiveness on the MIS multi-project problem. The MIS problem is representative of an environment which is markedly different from that used in previous research. The results indicate that the effectiveness of selected due date and resource scheduling heuristics is very similar to that previously reported. The introduction of the resource preemption factor significantly affects the selection of appropriate resource scheduling heuristics by managment. Recommendations are made for the selection of due date and resource scheduling heuristic combinations under the two preemption policies examined.