Accession Number:

ADA440387

Title:

Mapping Flows onto Networks to Optimize Organizational Processes

Descriptive Note:

Research rept.

Corporate Author:

CONNECTICUT UNIV STORRS DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE

Report Date:

2005-01-01

Pagination or Media Count:

25.0

Abstract:

Interdependence of tasks in a mission necessitates information flow among the organizational elements agents assigned to these tasks. This information flow introduces communication delays. An effective task schedule that minimizes the total execution time, including task processing and coordination delays, is an important issue in designing an organization and its task processing strategy. This paper defines the structure of information-dependent tasks, and describes an approach to map this structure to a network of organizational elements agents. Since the general problem of scheduling tasks with communication is NP-hard, only fast heuristic e.g., list scheduling and linear clustering algorithms are discussed. The authors modify the priority calculation for list scheduling methods, matching the critical path with a network of heterogeneous agents. They then present their algorithm, termed Heterogeneous Dynamic Bottom Level HDBL, and compare it with various list-scheduling heuristics. The results show that HDBL exhibits superior performance to all list scheduling algorithms, providing an improvement of over 25 in schedule length for communication-intensive task graphs.

Subject Categories:

  • Administration and Management
  • Information Science
  • Command, Control and Communications Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE