NASA Scientific and Technical Aerospace Reports

This dissertation presents a mathematical programming approach to the personnel tour scheduling problem based upon
a minimum cost network flow formulation with specialized side constraints. The linear program optimally solves the tour
scheduling problem for industries with continuous (24-hour) operations and a heterogeneous workforce, such as fast food
restaurants, hotels and resorts, university computer labs, nurses in large health care systems, and retail sales. The methodology
allows for a workforce with varying availabilities, part and full-time employees, differing skill-sets and wage rates, and
minimum and maximum shift requirements per week. Additionally, the formulation can quickly adjust an optimal schedule
due to sickness, vacation, hiring or firing with the workforce, and minimize the number of deviations within the original
schedule. A methodology that can optimally schedule both a continuous and a heterogeneous workforce in an insignificant
amount of computational time is unique in the literature. In many instances, the linear program generates integral solutions
to the tour-scheduling problem without branching, bounding, or cutting techniques. An interior-point method solves the
formulation in less than 3 seconds for large problem instances of 80 employees scheduled to 420 distinct shifts. The efficiency
of the formulation is presented for many test sets of problems as well as an application to the tour-scheduling problem of
computer lab staffing at Arizona State University and nurses with the Banner Health network of heath care providers.
DTIC
Heterogeneity; Linear Programming; Manpower; Personnel; Scheduling
20060001855 Connecticut Univ., Storrs, CT USA
A Library of Optimization Algorithms for Organizational Design
Levchuk, Georgiy M.; Levchuk, Yuri N.; Luo, Jie; Tu, Fang; Pattipati, Krishna R.; Jan. 1, 2005; 41 pp.; In English; Original
contains color illustrations
Contract(s)/Grant(s): N00014-93-1-0793; N00014-98-1-0465
Report No.(s): AD-A440389; No Copyright; Avail.: Defense Technical Information Center (DTIC)
This paper presents a library of algorithms to solve a broad range of optimization problems arising in the normative design
of organizations to execute a specific mission. The use of specific optimization algorithms for different phases of the design
process leads to an efficient matching between the mission structure and that of an organization and its resources/constraints.
This library of algorithms forms the core of the authors’ design software environment for synthesizing organizations that are
congruent with their missions. It allows an analyst to obtain an acceptable trade-off among multiple objectives and constraints,
as well as between computational complexity and solution efficiency (i.e., desired degree of sub-optimality).
DTIC
Algorithms; Command and Control; Libraries; Optimization; Organizations
20060001856 Naval Postgraduate School, Monterey, CA USA
Scenario Design for the Empirical Testing of Organizational Congruence
Kleinman, David L.; Levchuk, Georgiy M.; Hutchins, Susan G.; Kemple, William G.; Jan. 1, 2005; 14 pp.; In English;
Original contains color illustrations
Report No.(s): AD-A440390; No Copyright; Avail.: Defense Technical Information Center (DTIC)
Over the past several years, researchers within the ONR-sponsored Adaptive Architectures for Command and Control
(A2C2) research program have been investigating the concept of organizational ‘congruence.’ These model-based theories
loosely state that the better an organization is matched structurally to the overall mission (as measured using a multi-variant
set of workload/ congruence metrics) the better will that organization perform, and that mismatches are potential drivers for
the adaptation of organization structure. To test the congruence theories and their corollaries in a laboratory experiment, the
authors’ approach was to seek two sufficiently disparate organizational structures and then design two missions (or scenarios)
that would exploit the differences in these two structures. One scenario would be ‘tuned’ to organization 1 to exhibit a high
degree of congruence, but at the same time it would be ‘mismatched’ (i.e., exhibit low congruence) with organization 2.
Conversely, the second scenario would be engineered to be congruent with organization 2, but incongruent with organization
1. This paper describes the selection of the two organizations, and the model-driven design of the two scenarios.
DTIC
Command and Control; Congruences; Optimization; Organizations; War Games
20060001917 New Mexico State Univ., Las Cruces, NM USA
On Models for Coordination of Activity and It’s Disruption
Lakey, Joseph; Coombs, Mike; Izu, Scott; Weaver, Chris; Sep. 25, 2005; 25 pp.; In English
Contract(s)/Grant(s): DAAD19-02-1-0211
Report No.(s): AD-A440554; AS02-0145; NMSU-2003005; ARO-43787.3-MA; No Copyright; Avail.: Defense Technical
Information Center (DTIC)
179