Operations Research

This paper offers an introductory view of the concept of habitual domains. It describes how they affect behavior, discusses their formation, dynamics, stability, and application, and points out how to expand and enrich them. Finally, this concept is ...

A new methodology provides military decision makers with information on the aggregate effectiveness of large-scale conventional (nonnuclear) and combined nuclear and conventional force structures against a wide range of targets. This methodology coupled a ...

This paper proposes a classification scheme for discrete manufacturing systems. It also includes a brief discussion of modeling, analysis, and optimization techniques that have been applied to manufacturing. This taxonomy is intended to be a first step in ...

In this paper we present two iterative methods for solving a model to evaluate busy probabilities for Emergency Medical Service (EMS) vehicles. The model considers location dependent service times and is an alternative to the mean service calibration ...

Frequency domain methodology has been applied to discrete-event simulations to identify terms in a polynomial model of the simulation output. In this paper, the problem of optimally selecting input frequencies is studied. A fast algorithm is presented ...

The function of a digital telecommunications network is to transport demand of digital signals between pairs of locations. To achieve this economically, multiplex equipment packs lower rate digital signals into higher rate signals for routing over ...

We present a class of shake-and-bake algorithms for generating (asymptotically) uniform points on the boundary of full-dimensional bounded polyhedra. We also report results of simulations for some elementary test problems.

We extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some ...

This paper considers tradeoffs between cost and perturbations of the weights in a single facility, minisum location problem over a finite set of feasible points. Specifically, the paper characterizes a tradeoff curve of variability in the weights versus ...

A hierarchical approach to control a manufacturing system, subject to multiple machine states modeled by a Markov process with weak and strong interactions, is suggested. The idea is to aggregate strongly interacting or high transition probability states ...

A set of N jobs has to be processed on a single machine. Jobs have the same basic processing time, but the actual processing time of each job grows linearly with its starting time. A (possibly) different rate of growth is associated with each job. We show ...

The process planning problem is described for a class of flexible assembly systems for printed circuit cards. The general problem of minimizing the number of station visits is shown to be NP-complete, and two classes of heuristics are shown to have ...

Partitioning methods lend themselves very well to implementation on parallel computers. In recent years, branch-and-bound algorithms have been tested on various types of architectures. In this paper, we develop a queueing network model for the analysis of ...

State-space truncation is frequently demanded for computation of large or infinite Markov chains. Conditions are given that guarantee an error bound or rate of convergence. Roughly, these conditions apply either when probabilities of large states are ...