A Heuristic Search Approach to Planning and Scheduling of Software Projects
Abstract
In today’s highly competitive and constantly growing market for software products, planning and scheduling of software projects has become a bottleneck to increasing software production productivity [20]. There are several reasons why software manufacturing planning/scheduling is hard:
1. Even idealized formulations of the problem are NP-hard in the general case [8].
2. It involves face-to-face human negotiation between multiple agents to resolve the scheduling conflicts (i.e. unsatisfiable resource requests) that arise due to differences in goals, technical judgements, etc [6].
3. There is typically considerable uncertainty in budget (i.e. resource requirement) estimates and other project planning/scheduling constraints that must be accounted for [3, 11].
4. Software project planning and scheduling is not a static problem. Schedules must be continually revised over the course of the project as changes in planning/scheduling assumptions become known [7].
BibTeX
@incollection{Safavi-1990-15744,author = {A. Safavi and Stephen Smith},
title = {A Heuristic Search Approach to Planning and Scheduling of Software Projects},
booktitle = {Advances in Artificial Intelligence: Natural Language, and Knowledge-Based Systems},
publisher = {Springer-Verlag Publishers},
editor = {M. Golumbic},
year = {1990},
month = {September},
pages = {247 - 268},
}