Resource allocation and performance evaluation in large human-machine organizations

IEEE Transactions on Systems Man and CyberneticsPublished 1 January 1991

Petros Kapasouris, Daniel Serfaty, J. C. Deckert, Joseph G. Wohl, Krishna R. Pattipati

Citations25

TL;DR

Abstract

A methodology is presented for mapping the processes comprising a mission onto the capable resources within the organization such that the completion time of the terminal process in the mission is minimized. The authors then build a Petri net simulation directly from the output of the mapping algorithm to perform sensitivity analyses on the solution. This capability enables the analyst to study in an interactive way variations in the performance of the organization as a function of its workload capacity, the expertise distribution of its members, the task requirements, and the communication network linking the different resources in the organization.>

Keywords

Computer ScienceBusiness, Management and Accounting

Reducibility among Combinatorial Problems

10,823 Citations1972Richard M. Karp

Operations ResearchParallel Sequencing and Assembly Line Problems

895 Citations1961T. C. Hu

This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability, and how to arrange a schedule that requires the minimum number of men to complete all jobs within a prescribed time T.

IEEE Transactions on ComputersOn the Mapping Problem

584 Citations1981Bokhari

This mapping problem is formulated in graph theoretic terms and shown to be equivalent, in its most general form, to the graph isomorphism problem.

SIAM Journal on ComputingScheduling Graphs on Two Processors

75 Citations1976Ravi Sethi

Coffman and Graham give an algorithm for determining nonpreemptive schedules on two processors for such systems as directed acyclic graph (dag) D with n nodes and e edges.

Algorithms: Design and Analysis

42 Citations2015Harsh Bhasin

This book discusses the growth of FUNCTIONS, artificial intelligence, and machine learning approaches to biology and informatics, as well as practical applications such as search and discovery.

IEEE Transactions on Aerospace and Electronic SystemsOn mapping a tracking algorithm onto parallel processors

36 Citations1990Krishna R. Pattipati, T. Kurien +2 more

From the simulation results, it is concluded that task granularity and the parallelization of clustering and global hypotheses formation stages of the tracking algorithm are major determinants of speedup.

On the asymptotic optimality of a heuristic mapping algorithm

3 Citations2003R.-T. Lee, Krishna R. Pattipati +1 more

Extensive computational experiments show that the heuristic algorithm provides optimal solutions when the ratio of computation time to communication time is very large or very small, and that the pairwise exchange algorithm provides uniformly good mapping for all values of the ratio.

Mapping Missions Onto C3 Organizations: Incorporating the Goal Dimension in IAT

2 Citations1990Petros Kapasouris, Daniel Serfaty +3 more

Mapper is introduced, a prototype tool that maps the processes onto the capable resources in such a way as to minimize the completion time of the last process in a mission, and also illustrates a modeling and sensitivity analysis technique using Petri nets.

Resource allocation in large man-machine organizations

1 Citations2003Petros Kapasouris, Daniel Serfaty +3 more

An algorithm to map processes onto organizations is presented to minimize the completion time of the terminal process without violating the constraints which are defined in terms of the requirements of the processes and the capabilities of the resources.