Robust scheduling for large projects
Badr, Salah M.
Berzines, Valdis Andris
MetadataShow full item record
We have developed a heuristic scheduling method suitable for automatically scheduling tasks in a software development effort and assigning them to designers. Our experimental evaluations of the algorithm show that it is highly effective at finding feasible schedules when they exist. A modification of the algorithm can suggest nearly minimal adjustments to the deadlines in cases where no feasible schedule exists. This is useful because it provides guidance to the project manager for formulating a proper response when a project gets late and all of the planned tasks cannot be completed with their deadlines. The algorithms are fast enough to support constant rescheduling as circumstances change, for most projects of practical size.
Approved for public release; distribution is unlimited.
NPS Report NumberNPS-CS-93-012
Showing items related by title, author, creator and subject.
Evans, John (Monterey, California. Naval Postgraduate School, 1997-09);Optimally scheduling a team of developers on a large software project is an NP- complete problem. The scheduling algorithm employed by the Evolutionary Control System (ECS) portion of the Computer-Aided Prototyping System ...
Marsh, Stewart Iden Jr. (Monterey, California. Naval Postgraduate School, 1976-12);An algorithm is proposed for scheduling project networks having a single constraining resource and a constant level of available resources. The algorithm seeks to generate a minimum length schedule indirectly by maximizing ...
Karadaḡ, Osman (Monterey, California. Naval Postgraduate School, 1980-09);This thesis considers the combining of a ship overhaul project network with a shipyard project network to minimize possible scheduling conflicts during the ship overhaul process. The combined project is called the ship ...