O-Cubed Modeling and Simulator for Computational Organization Design

This paper discusses the development of O-cubed (operational organization oriented) modeling and a simulator for computational organization design. O-cubed modeling is used to describe an organization model in terms of models of coordination structures, tasks, and agents. The model of a coordination structure can represent not only task decomposition and allocation, but also choices between hierarchical management and autonomous management. The model of a task can represent the workflow within an organization. Using the O-cubed simulator, we can easily describe the models for coordination structure, tasks and agents, so that agents can make decisions concerning task processing and choose coordination structures effectively. In order to show applicability of the modeling and simulator, we describe an O-Cubed model of cooperation in a kitchen of a restaurant. The cooperation is good example to explain organization design, because it contains balanced elements of coordination structures, tasks, and agents. The example show that the organization models described by O-cubed modeling and the simulator are promising models for designing organizations.     

Promotion Systems and Organizational Performance: A Contingency Model

This study explores the organizational impact of a variety of important promotion systems commonly practiced in organizations including up-or-out systems, absolute merit-based systems, relative merit-based systems, and seniority-based systems. Through the computer simulation of organizations in a distributed decision making setting, the results indicate that the effectiveness of any promotion system is dependent on a range of factors including the nature of the task environment, the design of the organizational structure, the frequency of monitoring, the criteria of performance, and the transferability of task knowledge. This study has implications not only for understanding organizational promotion systems from the contingency perspective, but also for bridging the fields of strategic human resource management and computational organization theory.     

The virtual design team: A computational model of project organizations

Large scale and multidisciplinary engineering projects (e.g., design of a hospital building) are often complex. They usually involve many interdependent activities and require intensive coordination among actors (i.e., designers) to deal with activity interdependencies. To make such projects more effective and efficient, one needs to understand how coordination requirements are generated and what coordination mechanisms should be applied for given project situations. Our research on the Virtual Design Team (VDT) attempts to develop a computational model of project organizations to analyze how activity interdependencies raise coordination needs and how organization design and communication tools change team coordination capacity and project performance. The VDT model is built based on contingency theory (Galbraith, 1977) and our observations about collaborative and multidisciplinary work in large, complex projects. VDT explicitly models actors, activities, communication tools and organizations. Based on our extended information-processing view of organizations, VDT simulates the actions of, and interactions among actors as processes of attention allocation, capacity allocation, and communication. VDT evaluates organization performance by measuring emergent project duration, direct cost, and coordination quality. The VDT model has been tested internally, and evaluated externally through case-studies. We found three way qualitative consistency among predictions of the simulation model, of organization theory, and of experienced project managers. In this paper, we present the VDT model in detail and discuss some general issues involved in computational organization modeling, including level of abstraction of tasks and actors' reasoning, and model validation.     

Emergent learning behaviour in a simulated organization faced with tasks requiring team effort

We conceptualize organizational learning as a result of the collective learning behaviour of knowledge agents in an organization. Each agent provides a range of attributes that may be required to perform organizational tasks. We devised a computational model consisting of three processes to simulate an organization's response to performing repeated tasks: (1) Expert Selection Process for selecting the winner knowledge agent or lead agent; (2) Plan Formation Process for deciding what additional attributes are needed, but not possessed by the winner expert agent, and iteratively selecting further agents with the needed attributes until the task can be accomplished by the combined attributes of the ‘coalition of agents’ so formed; and (3) Capital Modification Process for rewarding participating agents according to the success of their combined organizational performance. We observed the simulated results for different combinations of three levels of task difficulty (requiring, respectively, 5, 10 and, 15 different attributes, each at a sufficient level in the coalition or team to complete the task), and three levels of selection, during plan formation, for knowledge agent performance (the extent to which selection favours knowledge agents with much capital or large strength versus knowledge agents without much capital or large strength). The simulated organization exhibited aspects of both single loop and double loop learning, in repeatedly performing the same task, and ‘learning to perform the task’ with the smallest possible team.     

Computational and mathematical organization theory: Perspective and directions

Computational and mathematical organization theory is an interdisciplinary scientific area whose research members focus on developing and testing organizational theory using formal models. The community shares a theoretical view of organizations as collections of processes and intelligent adaptive agents that are task oriented, socially situated, technologically bound, and continuously changing. Behavior within the organization is seen to affect and be affected by the organization's, position in the external environment. The community also shares a methodological orientation toward the use of formal models for developing and testing theory. These models are both computational (e.g., simulation, emulation, expert systems, computer-assisted numerical analysis) and mathematical (e.g., formal logic, matrix algebra, network analysis, discrete and continuous equations). Much of the research in this area falls into four areas: organizational design, organizational learning, organizations and information technology, and organizational evolution and change. Historically, much of the work in this area has been focused on the issue how should organizations be designed. The work in this subarea is cumulative and tied to other subfields within organization theory more generally. The second most developed area is organizational learning. This research, however, is more tied to the work in psychology, cognitive science, and artificial intelligence than to general organization theory. Currently there is increased activity in the subareas of organizations and information technology and organizational evolution and change. Advances in these areas may be made possible by combining network analysis techniques with an information processing approach to organizations. Formal approaches are particularly valuable to all of these areas given the complex adaptive nature of the organizational agents and the complex dynamic nature of the environment faced by these agents and the organizations.This paper was previously presented at the 1995 Informs meeting in Los Angeles, CA.     

Computational experimentation on new organizational forms: Exploring behavior and performance of <Emphasis Type="Italic">Edge</Emphasis> organizations

New organizational forms are being conceived and proposed continually, but because many such organizations remain conceptual—and hence have no basis for empirical assessment—their putative advantages over extant organizational forms are difficult to evaluate. Moreover, many such organizational forms are proposed without solid grounding in our cannon of organization theory; hence understanding their various theoretical properties in terms of our familiar, archetypal forms remains difficult. This poses problems for the practitioner and researcher alike. The Edge represents one such, recent, conceptual organizational form, which lacks readily observable examples in practice, and the conceptualization of which is not rooted well in our established organization theory. Nonetheless, proponents of this new form argue its putative advantages over existing counterparts, with an emphasis upon complex, dynamic, equivocal environmental contexts; hence the appeal of this form in today’s organizational environment. The research described in this article employs methods and tools of computational experimentation to explore empirically the behavior and performance of Edge organizations, using the predominant and classic Hierarchy as a basis of comparison. We root our models of these competing forms firmly in Organization Theory, and we make our representations of organizational assumptions explicit via semi-formal models, which can be shared with other researchers. The results reveal insightful dynamic patterns and differential performance capabilities of Hierarchy and Edge organizations, and they elucidate theoretical ramifications for continued research along these lines, along with results amenable to practical application. This work also highlights the powerful role that computational experimentation can play as a complementary, bridging research method. Mark Nissen is Associate Professor of Information Systems and Management at the Naval Postgraduate School. His research focuses on dynamic knowledge and organization. He views work, technology and organization as an integrated design problem, and has concentrated recently on the phenomenology of knowledge flows. Mark’s publications span information systems, project management, organization studies, knowledge management and related fields. In 2000 he received the Menneken Faculty Award for Excellence in Scientific Research, the top research award available to faculty at the Naval Postgraduate School. In 2001 he received a prestigious Young Investigator Grant Award from the Office of Naval Research for work on knowledge-flow theory. In 2002–2003 he was Visiting Professor at Stanford, integrating knowledge-flow theory into agent-based tools for computational modeling. Before his information systems doctoral work at the University of Southern California, he acquired over a dozen years’ management experience in the aerospace and electronics industries.     

Efficient use of parallelism in algorithmic parameter optimization applications

In the context of algorithmic parameter optimization, there is much room for efficient usage of computational resources. We consider the Opal framework in which a nonsmooth optimization problem models the parameter identification task, and is solved by a mesh adaptive direct search solver. Each evaluation of trial parameters requires the processing of a potentially large number of independent tasks. We describe and evaluate several strategies for using parallelism in this setting. Our test scenario consists in optimizing five parameters of a trust-region method for smooth unconstrained minimization.     

Boosting distributed constraint satisfaction

Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint satisfaction that makes use of both cooperation and competition. This framework improves the performance of two different standard algorithms by one order of magnitude. Furthermore, it can reduce the risk of poor performance by up to three orders of magnitude diminishing the heavy-tailed behaviour of complete distributed search. Moreover it greatly reduces the classical idleness flaw usually observed in distributed tree-based searches. We expect our new methods to be similarly beneficial for any tree-based distributed search and describe ways on how to incorporate them. Remarkably, our ideas while applied to a parallel SAT setting were able to beat divide-and-conquers approaches, and win the gold medal of the parallel track of the 2008 SAT-Race.     

Computationally modeling organizational learning and adaptability as resource allocation: An artificial adaptive systems approach

A framework for and a computational model of organizational behavior based on an artificial adaptive system (AAS) is presented. An AAS, a modeling approach based on genetic algorithms, enables the modeling of organizational learning and adaptability. This learning can be represented as decisions to allocate resources to the higher performing organizational agents (i.e., individuals, groups, departments, or processes, depending on the level of analysis) critical to the organization's survival in different environments. Adaptability results from the learning function enabling the organizations to change as the environment changes. An AAS models organizational behavior from a micro-unit perspective, where organizational behavior is a function of the aggregate actions and interactions of each of the individual agents of which the organization is composed. An AAS enables organizational decision making in a dynamic environment to be modeled as a satisficing process and not as a maximization process. To demonstrate the feasibility and usefulness of such an approach, a financial trading adaptive system (FTAS) organization is computationally modeled based on the AAS framework. An FTAS is an example of how the learning mechanism in an AAS can be used to allocate resources to critical individuals, processes, functions, or departments within an organization.     

Adaptation as a Morphing Process: A Methodology for the Design and Evaluation of Adaptive Organizational Structures

Changes in objectives, in resources, or in the environment may necessitate the adaptation of an organization from one form to another. However, in many cases, the organizations need to continue functioning while adaptation takes place, i.e., it is not possible to stop the organizational activity in order to reorganize, and then start again. In this case, adaptation can be expressed as a morphing process in which the organization transitions from one form with its attendant task allocation to a different one through a series of incremental steps that preserve overall functionality and performance. Coordination between organization members during adaptation is critical. A computational model for this type of organizational adaptation at the operational level is presented. The model is implemented using the Colored Petri Net formulation of discrete event dynamical systems. A design methodology that utilizes this model is outlined and a simple example is used to illustrate the approach.     

A parallel interior point decomposition algorithm for block angular semidefinite programs

We present a two phase interior point decomposition framework for solving semidefinite (SDP) relaxations of sparse maxcut, stable set, and box constrained quadratic programs. In phase 1, we suitably modify the matrix completion scheme of Fukuda et al. (SIAM J. Optim. 11:647–674, 2000) to preprocess an existing SDP into an equivalent SDP in the block-angular form. In phase 2, we solve the resulting block-angular SDP using a regularized interior point decomposition algorithm, in an iterative fashion between a master problem (a quadratic program); and decomposed and distributed subproblems (smaller SDPs) in a parallel and distributed high performance computing environment. We compare our MPI (Message Passing Interface) implementation of the decomposition algorithm on the distributed Henry2 cluster with the OpenMP version of CSDP (Borchers and Young in Comput. Optim. Appl. 37:355–369, 2007) on the IBM Power5 shared memory system at NC State University. Our computational results indicate that the decomposition algorithm (a) solves large SDPs to 2–3 digits of accuracy where CSDP runs out of memory; (b) returns competitive solution times with the OpenMP version of CSDP, and (c) attains a good parallel scalability. Comparing our results with Fujisawa et al. (Optim. Methods Softw. 21:17–39, 2006), we also show that a suitable modification of the matrix completion scheme can be used in the solution of larger SDPs than was previously possible.     

Multiscale decision-making: Bridging organizational scales in systems with distributed decision-makers

Decision-making in organizations is complex due to interdependencies among decision-makers (agents) within and across organizational hierarchies. We propose a multiscale decision-making model that captures and analyzes multiscale agent interactions in large, distributed decision-making systems. In general, multiscale systems exhibit phenomena that are coupled through various temporal, spatial and organizational scales. Our model focuses on the organizational scale and provides analytic, closed-form solutions which enable agents across all organizational scales to select a best course of action. By setting an optimal intensity level for agent interactions, an organizational designer can align the choices of self-interested agents with the overall goals of the organization. Moreover, our results demonstrate when local and aggregate information exchange is sufficient for system-wide optimal decision-making. We motivate the model and illustrate its capabilities using a manufacturing enterprise example.     

Convex Modeling of Interactions With Strong Heredity

We consider the task of fitting a regression model involving interactions among a potentially large set of covariates, in which we wish to enforce strong heredity. We propose FAMILY, a very general framework for this task. Our proposal is a generalization of several existing methods, such as VANISH, hierNet, the all-pairs lasso, and the lasso using only main effects. It can be formulated as the solution to a convex optimization problem, which we solve using an efficient alternating directions method of multipliers (ADMM) algorithm. This algorithm has guaranteed convergence to the global optimum, can be easily specialized to any convex penalty function of interest, and allows for a straightforward extension to the setting of generalized linear models. We derive an unbiased estimator of the degrees of freedom of FAMILY, and explore its performance in a simulation study and on an HIV sequence dataset. Supplementary materials for this article are available online.     

Distributed event-triggered hybrid wired-wireless networked control with $${H_2}/{H_\infty }$$ filtering

Aiming at the fact that distributed multi-channel hybrid network-induced delays and noise interference may deteriorate the control performance of hybrid networked control systems, distributed event-triggered hybrid wired-wireless networked control with \({H_2}/{H_\infty }\) filtering is proposed. A distributed event-triggered mechanism is firstly employed to reduce communication burden, and two Markov chains are used to respectively describe different characters of network-induced delays of hybrid wired-wireless networks. Then, a \({H_2}/{H_\infty }\) filter is employed to improve the input signal precision of the controller, where a general closed-feedback filtering and control system model with distributed event-triggered parameters and network-induced delays of hybrid wired-wireless networks is proposed. Furthermore, the designed filter and controller enable the closed-feedback filtering and control system to be stochastic stability and to achieve a prescribed \({H_2}/{H_\infty }\) performance, and the relationships between the stability criteria and the maximum network-induced delays, distributed event-triggered parameters, the filter and controller parameters and the system performance parameter are established. Finally, simulation results confirm the effectiveness of the proposed method.     

Adapting to the Changing Environment: A Theoretical Comparison of Decision Making Proficiency of Lean and Mass Organization Systems

In this paper weexamine the adaptability of the Japanese style leanorganization system and the traditional American style mass organizationsystem under changing environments. From an organizational designperspective, key structural aspects of the two organizations are modeled ina problem solving context using computational methods. Organizational-levelperformance in terms of decision making accuracy and severity of errors ismeasured as an indicator of organizational adaptability under conditionswhere the task environment shifts between predictable to unpredictable orvise versa. Our study shows that both organizations have their respectiveadvantages under different task environments and that they adapt toenvironmental shifts in different forms. Specifically, when the timepressure is high the lean organization system's performance isvirtually identical to the mass organization system, even though the leanorganization systemÆs members are more proactive. When the timepressure is low, the mass organization system shows a much fasteradaptability when the environment shifts to a predictable one but it is alsomore vulnerable when the environment shifts to an unpredictable one. Incontrast, the lean organization systemÆs response to the changingenvironment is characterized by its slower adaptability. When theenvironment shifts to an unpredictable one, the lean organization systemshows a gradual improvement till reaching a high level. When the environmentshifts to a predictable one, however, the lean organization system shows agradual decrease of performance. Our study further shows that the leanorganization system, with its strong team decision making emphasis, can bemore successful in avoiding severe errors when compared with the massorganization system, even under a predictable task environment.     

Network design for time-constrained delivery using subgraphs

Delivery companies are offering an increasing number of time-definite services. Yet, little research has been done that explores the design of delivery networks that can support these types of services. In this paper, we explore such design problems for networks with a specified number of edges $B > n-1$ , where $n$ is the number of nodes in the problem. We present a two-phase heuristic solution approach that first constructs a network and then improves the network via local search. For the improvement phase, we extend neighborhood structures that have proven effective for tree-structured solutions and also identify a new search neighborhood that takes advantage of specific features of subgraph solutions. We present a computational analysis of our solution approach as well as managerial insights.     

An exact branch-and-price algorithm for scheduling rescue units during disaster response

In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments – including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature – for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.     

Numerical solution of linear Volterra integral equations of the second kind with sharp gradients

Collocation methods are a well-developed approach for the numerical solution of smooth and weakly singular Volterra integral equations. In this paper, we extend these methods through the use of partitioned quadrature based on the qualocation framework, to allow the efficient numerical solution of linear, scalar Volterra integral equations of the second kind with smooth kernels containing sharp gradients. In this case, the standard collocation methods may lose computational efficiency despite the smoothness of the kernel. We illustrate how the qualocation framework can allow one to focus computational effort where necessary through improved quadrature approximations, while keeping the solution approximation fixed. The computational performance improvement introduced by our new method is examined through several test examples. The final example we consider is the original problem that motivated this work: the problem of calculating the probability density associated with a continuous-time random walk in three dimensions that may be killed at a fixed lattice site. To demonstrate how separating the solution approximation from quadrature approximation may improve computational performance, we also compare our new method to several existing Gregory, Sinc, and global spectral methods, where quadrature approximation and solution approximation are coupled.     

A game-theoretic model for repeated assignment problem between two selfish agents

This paper addresses a distributed system where a manager needs to assign a piece of equipment repeatedly between two selfish agents. On each day, each agent may encounter a task—routine or valuable—and can request the use of the manager's equipment to perform the task. Because the equipment benefits a valuable task more than a routine task, the manager wants to assign the equipment to a valuable task whenever possible. The two selfish agents, however, are only concerned with their own reward and do not have incentive to report their task types truthfully. To improve the system's overall performance, we design a token system such that an agent needs to spend tokens from his token bank to bid for the equipment. The two selfish agents become two players in a two-person non-zero-sum game. We find the Nash equilibrium of this game, and use numerical examples to illustrate the benefit of the token system.