Robust scheduling for large projects
By: by Valdis Berzins, Salah Badr
Contributors: Badr, Salah M.; Naval Postgraduate School (U.S.). Dept. of Computer Science
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1993
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 22
Subjects: SCHEDULING; ALGORITHMS; COMPUTER PROGRAMS
Other titles: NPS-CS-93-012.
Description: 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. Project scheduling, Uncertainty, Automatic deadline adjustment.
Notes: Cover title.

"NPS-CS-93-012."

"December 1993."

AD A279 753.

Includes bibliographical references (p. 21-22).

aq/aq cc:9116 03/21/97.