Robust Scheduling for Large Projects

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1993
Accession Number
ADA279753

Entities

People

  • Salah Badr
  • Valdis A. Berzins

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • California
  • Classification
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Human Resources
  • Military Research
  • Personal Information Managers
  • Security
  • Simulations
  • Software Development
  • Software Prototyping
  • Trees (Data Structures)

Fields of Study

  • Computer science
  • Engineering

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design