bluuebunny/crossref_metadata_2025_split huggingface dataset:
Communications Environment and its Relationship to Organizational Structure
Authors: Conrath David W. 
Published: November 2008

This paper is concerned with the relationships between modes of communication, the communication environment and organizational structure. This is a very neglected area of organizational analysis, which is surprising considering the possible implications of such relationships. A framework is presented within which the above relationships can be identified and studied. Field research methodology is essential to the effort and is discussed in some detail, along with the associated problems of measure and measurement of organizational communications behaviour and organizational structure. An empirical study is described, and some initial propositions tested. Distance appears to be a dominant factor in the mode of communication chosen, and it strongly influences the association of formal structural relations with modes of communication. Such conclusions are tentative, however, as we are describing an on-going research effort.
Simulation, Synthesis and Urban Public Decision-Making
Authors: Goldberg Michael A. 
Published: November 2008

The 1960's saw the introduction of simulation techniques into the area of urban and regional planning. The present paper describes a large-scale urban simulation effort currently underway in Vancouver, British Columbia. The project differs from similar work in a number of ways. Most notably, the current effort stresses the process of model-building, including the widespread public use and discussion of the work and its limitations. The paper emphasizes this process orientation, and illustrates the content of the models with a detailed description of the economic submodel. This submodel combines input-output analysis with a simulation model of final demands to yield consistent economic forecasts for the region. Capsule summaries of the other submodels are also presented. The paper concludes with a focus on questions of use and misuse of simulation models.
A Simulation Model for the Evaluation of Fishing Trawler Designs
Authors: Nickerson T. B. , O'Flaherty T. G. , Rice D. W. 
Published: November 2008

This paper describes the development, testing, validation and application of a computer simulation model. The model is designed to determine the economic potential of a specified offshore stern fishing trawler. The basic structure of the model consists of four sections: (1) Skipper section-this is the decision-maker in the model; (2) Vessel section—the vessel with its crew carry out the actions decided on by the skipper. (3) Environment section—distributions are specified here for catch rates and weather conditions, varying over time. (4) Operational section—this section contains the overall time-keeping function, financial accounting routines, data banks, and so on. Validation was carried out by specifying to the program particulars of actual vessels for which operational data existed, and then comparing the model results with the actual recorded results. The model was applied to identifying, from among a range of vessel designs, those that ranked highest according to various specified economic criteria.
A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
Authors: Glover Fred , Karney D. , Klingman D. , Napier A. 
Published: November 2008

This paper presents an in-depth computational comparison of the basic solution algorithms for solving transportation problems. The comparison is performed using “state of the art” computer codes for the dual simplex transportation method, the out-of-kilter method, and the primal simplex transportation method (often referred to as the Row-Column Sum Method or M O D I method). In addition, these codes are compared against a state of the art large scale LP code, O P H E L I E/LP. The study discloses that the most efficient solution procedure arises by coupling a primal transportation algorithm (embodying recently developed methods for accelerating the determination of basis trees and dual evaluators) with a version of the Row Minimum start rule and a “modified row first negative evaluator” rule. The resulting method has been found to be at least 100 times faster than OPHELIE, and 9 times faster than a streamlined version of the SHARE out-of-kilter code. The method's median solution time for solving 1000 × 1000 transportation problems on a CDC 6600 computer is 17 seconds with a range of 14 to 22 seconds. Some of the unique characteristics of this study are (1) all of the fundamental solution techniques are tested on the same machine and the same problems, (2) a broad spectrum of problem sizes are examined, varying from 10 × 10 to 1000 × 1000; (3) a broad profile of nondense problems are examined ranging from 100 percent to 1 percent dense; and (4) additional tests using the best of the codes have been made on three other machines (IBM 360/65, UNIVAC 1108, and CDC 6400), providing surprising insights into conclusions based on comparing times on different machines and compilers.
Self-Scaling Variable Metric (SSVM) Algorithms
Authors: Oren Shmuel S. , Luenberger David G. 
Published: November 2008

A new criterion is introduced for comparing the convergence properties of variable metric algorithms, focusing on stepwise descent properties. This criterion is a bound on the rate of decrease in the function value at each iterative step (single-step convergence rate). Using this criterion as a basis for algorithm development leads to the introduction of variable coefficients to rescale the objective function at each iteration, and, correspondingly, to a new class of variable metric algorithms. Effective scaling can be implemented by restricting the parameters in a two-parameter family of variable metric algorithms. Conditions are derived for these parameters that guarantee monotonic improvement in the single-step convergence rate. These conditions are obtained by analyzing the eigenvalue structure of the associated inverse Hessian approximations.
General Planning Horizons for Production Smoothing with Deterministic Demands
Authors: Kunreuther Howard C. , Morton Thomas E. 
Published: November 2008

In Part I of this paper, we developed an algorithm for finding planning horizons for the deterministic production smoothing problem when all demand was required to be met from regular production, under rather general assumptions for the production, production smoothing, and holding cost functions. Here, in Part II, we develop analogous planning horizons when the model is extended to include such factors as overtime, lost sales, simple subcontracting, undertime, and backlogging. Part II depends heavily on Part I. To avoid unnecessary tedium, all cost functions will be assumed to be stationary in Part II. Overtime, undertime, holding, and backlogging will be assumed to be convex increasing, all other costs linear and proportional. However, it is not difficult to see that the techniques of Part I can be utilized directly to cover more general cost functions. Part II concludes with a discussion of the application of our general approach to actual data.
Labor Flexibility in Multiechelon Dual-Constraint Job Shops
Authors: Frye John S. 
Published: November 2008

In this paper a simulation study of the effects of labor flexibility on the performance of a multiechelon dual-constraint job shop is described. Machines and workers are constraining resources in the hypothetical shop. The organizational structure of the shop consists of divisions comprised of work centers that contain machines and workers. There are fewer workers than machines. Independent variables are interdivisional and intradivisional labor flexibility. Mean flow-time, flow-time variance and worker transfers between divisions and work centers are used as measures of shop performance. Labor flexibility is shown to have a major effect on shop performance. The effectiveness of interdivisional labor flexibility as a management variable is found to be concentrated in the region of high flexibility while intradivisional labor flexibility is most effective in the region of low flexibility.
Representational Systems Theory
Authors: Betz Frederick , Mitroff Ian I. 
Published: November 2008

The methodology of simulation involves a representational approach to observed phenomena. Systems theory has been, in the past, more terminology than theory. However, a logical classification of the possible representational forms available for any simulation would serve as a meta-theory in simulation methodology. This paper presents such a classification based upon an analysis of the possible kinds of relations of explanation which can be used to connect elements of existential sets. Four types of relations are possible: cause-effect, producer-product, genetic, accidental. Of these, only two (the cause-effect and producer-product) have been used to construct formal representations in science: ateleological and teleological representations. This taxonomy, together with the notions of open and closed systems, provides a logical framework for any general form of a simulation. We show how familiar paradigms such as decision theory, allocation problems and stochastic processes are derived in this representational theory.
Optimal Portfolio Revision with a Proportional Transaction Cost
Authors: Kamin Jules H. 
Published: November 2008

The theory of the optimal investment decision is reexamined for a case in which the portfolio initialization problem is trivial but the portfolio adjustment decision presents some new and important problems. The investor is assumed to be a risk-averse expected utility maximizer whose portfolio consists of two risky assets. His objective is to maximize his expected utility at some time horizon, and there is a transaction cost for intermediate adjustment of the portfolio proportional to the value of assets traded. The solution for the optimum adjustment strategy consists of a set of pairs of control limits for the ratio of the amounts of the assets in the portfolio, one pair for each decision opportunity. The model falls naturally into the class of “cash balance” and dynamic portfolio selection models. The most important departure from both of these subclasses of models is the explicit consideration of more than one risky asset in the portfolio together with the transaction cost. The introduction of the transaction cost implies investor behavior which is systematically different from that implied by the no-transaction-cost dynamic portfolio selection models. The implied behavior is, however, quite similar in form to that implied by the cash-balance models, in which the objective is expected cost minimization.
Multi-Period Stochastic Dominance
Authors: Levy Haim , Paroush Jacob 
Published: November 2008

First degree stochastic dominance rules for uncertain options (distributions of returns) have been developed for the following two cases: (a) multi-period additive utility functions, (b) univariate utility functions and compound distributions of returns. In the first case, the suggested rule is a necessary and sufficient criterion for efficiency analysis, while in the second case we provide only sufficiency conditions for dominance. For the univariate case an efficient set of portfolios can be constructed for investment groups that differ in their investment horizon. Where returns over time are independent, the longer the investment horizon the smaller the efficient set. However, the relationship between the size of the efficient set and the investment horizon is not simple when interdependence of returns is allowed.
Rim Multiparametric Linear Programming
Authors: Gal Tomas 
Published: November 2008

The rim multiparametric linear programming problem (RMPLP) is a parametric problem with a vector-parameter in both the right-hand side and objective function (i.e., in the “rim”). The RMPLP determines the region K* ⊂ E* such that the problem, maximize z(λ) = cT(λ)x, subject to Ax = b(λ), x ≧ 0, has a finite optimal solution for all λ ∈ K*. Let Bi be an optimal basis to the given problem, and let Ri*, be a region assigned to Bi such that for all λ ∈ Ri* the basis Bi is optimal. The goal of the RMPLP problem is to cover K* by the Ri* such that the various Ri* do not overlap. The purpose of this paper is to present a solution method for finding all regions Ri* that cover K* and do not overlap. This method is based upon an algorithm for a multiparametric problem described in an earlier paper by Gal and Nedoma.
Production, Inventory and Capacity Expansion Scheduling with Integer Variables
Authors: Barchi R. H. , Sparrow F. T. , Vemuganti R. R. 
Published: November 2008

The combined production-inventory and capacity expansion problem is modeled as a linear, integer program. The model assumes constant returns to scale in the production function of a firm which must meet, at minimum cost, deterministic demands for a single product over N periods with no backordering. A linear transformation is used to obtain an equivalent form of the model which is then decomposed into fixed cost and variable cost parts. A global optimum is obtained by enumerating on the fixed cost variables and solving transportation sub-problems with the remaining variables. Special demand and cost structures and extensions are discussed, and computational experience presented.
The Science-Technology-Utilization Relationship in Management
Authors: Gruber William H. , Niles John S. 
Published: November 2008

The transfer of management science into management practice is examined. Starting with the TIMS definition of management science, we delineate three fundamental classes of activity and associated personnel: (1) management science and scientists, (2) management technology and technologists, (3) management practice and managers. The inter-group communication flows which are necessary for the transfer of management science into management practice are then developed. The examination of management science utilization problems leads us to the hypothesis that management scientists have only commented upon, rather than studied, the process of management science application. Here a structure for such a study is developed.
Efficient Estimators for Simulated Queueing Systems
Authors: Law Averill M. 
Published: November 2008

In this paper we consider efficient estimators for simulated queueing systems. It is shown to be more efficient to estimate all of the usual first moment measures of performance from an estimate of mean delay in queue than to estimate them directly. For single-server queues an estimator is introduced which is more efficient than the normal estimator of mean delay in queue.
Multi-Period Consumption Decision under Conditions of Uncertainty
Authors: Levy Haim 
Published: November 2008

An investor is faced with several investment alternatives. Any investment plan induces a vector of consumption where the consumption in each period is a random variable. Obviously, the optimal vector of consumption is determined by the multi-period utility function. However, in most cases we have no information on the investor's preference, and hence we cannot choose the optimal consumption strategy. Assuming that the multi-period utility function is nondecreasing we establish a decision rule which divides the feasible set of consumption strategies into two sets: the “efficient set” and the “inefficient set.” Thus, in the second step each investor selects the optimal consumption strategy from the efficient set according to his preference.
A Problem in Single-Machine Sequencing with Nonlinear Delay Costs
Authors: Henderson Peter B. , Steiglitz Kenneth 
Published: November 2008

We examine a class of single-machine sequencing problems which originate from scheduling considerations for a single-server queueing system with nonlinear costs of delay. Associated with each request awaiting service (sequencing) are a known service time, a known arrival time, and a nondecreasing cost function which is identical for each request. Two sequencing problems are considered; a request incurs cost from its arrival time to the time when it (1) commences service or (2) completes service. Our objective is a sequence which minimizes the total incurred cost. Necessary conditions for the optimal sequencing of requests are given for convex nondecreasing and quadratic cost functions. These conditions and a new lower bound function are used in a branch-and-bound algorithm to obtain computational results.
A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
Authors: Robinson Don R. 
Published: November 2008

To solve the problem of time-cost tradeoff in project management with available models, a choice must be made between heuristic approaches and algorithms based upon restrictive assumptions about the shape of the cost-time functions of the activities. The algorithm presented in this article involves a dynamic-programming approach to determine the allocation which minimizes the duration of the project (critical path). The main advantage of this model is its ability to determine the optimum allocation among activities with arbitrary cost-time functions. Also, computational shortcuts for functions with special properties can be used to increase the efficiency of the model. Objective functions of networks with special structures decompose into sequences of one-dimensional optimization problems. Although some complex networks have objective functions which cannot be fully decomposed, the dimensions of these functions are considerably less than the number of activities involved. If the activities have nonincreasing cost-time functions, an optimal policy can be used to eliminate the usual search procedure for one-dimensional problems which involve minimizing the maximum of stage returns.
Comparison of Computer Algorithms and Visual Based Methods for Plant Layout
Authors: Scriabin Michael , Vergin Roger C. 
Published: November 2008

Increasing emphasis on the reduction of materials handling costs in the modern plant has led to research into new methods of planning the process type layout in such a way as to minimize these costs. This project compares the performances of three highly rated computer algorithms prescribed for the solution of the plant layout problem with the performances of selected human subjects using the manual and visual methods still used and recommended by industrial engineers for plant layout design. The objective of this comparison is to determine whether there is in fact an advantage to using one of the available computer programs to solve the problem, instead of designing the layout by traditional visual-based methods. These tests, performed under the control of a computer system which accurately recorded the solutions achieved by each subject, show not only that the computer algorithms do not perform better than selected human subjects in the design of plant layouts, but that the human subjects, without the benefit of any prescriptive help from a computer, actually achieve layouts which are stochastically better than those produced by the computer programs.
Potential Avoidability: A Statistic for Controlling In-Patient Utilization in Acute Care Hospitals
Authors: Chorba R. W. 
Published: November 2008

A patient-day of service is classified as potentially avoidable if the unique facilities and manpower of an acute care hospital are not essential to providing the services received. From a practical standpoint, not all potentially avoidable days are truly avoidable. However, norms can be established, specific to diagnosis, surgery, sex, and age, which specify an acceptable range for the percentage of potentially avoidable days. A procedure is developed for efficiently assessing potential avoidability, making it feasible to measure this concept for every patient on a daily basis. The resultant data base can then be used in utilization review screening to detect abnormal patterns of utilization by case, physician, or hospital.
Disutility as a Probability: A Reconsideration of the Symmetry Approach to the Committee Decision Problem
Authors: Theil Henri 
Published: November 2008

Von Neumann and Morgenstern formulated the expected-utiiity approach in terms of a simultaneous utility-probability axiomatization, which makes utility unique up to a linear transformation. This note illustrates, that there are situations in which it is convenient to consider utility or, more precisely, disutility as a probability. The disutility caused by the best decision is zero: that caused by any other decision is nonnegative and usually positive: the only further condition which disutilities must satisfy in order to qualify as probabilities is that they add up to 1, for which a linear transformation of the utility function can be used. Disutility may thus be interpreted as the “probability of injury.” This idea is illustrated by means of the symmetry approach to the committee decision problem as formulated by Van den Bogaard and Versiuis [van den Bogaard, P. J. M., J. Versluis. 1962. The design, of optimal committee decisions. Statistica Neerlandica 16 271–289.] and Theil [Theil, H. 1963. On the symmetry approach to the committee decision problem. Management Sci. 9 380–393; Theil, H. 1964. Optimal Decision Rules for Government and Industry. American Elsevier Publishing Co., Inc., New York, and North-Holland Publishing Company. Amsterdam.]. Each committee member has his own preferences, but the committee as a whole is responsible for making a decision. The committee's debate is described in terms of a Markov chain, and the symmetry approach appears to correspond to the steady state of Markov chain theory. An application to a three-member committee is discussed.
Multiple Objective Linear Programming with Interval Criterion Weights
Authors: Steuer Ralph E. 
Published: November 2008

The purpose of this research is to develop a computer applicable methodology for analyzing multiple objective linear programming problems when interval, rather than fixed, weights are assigned to each of the objectives. Rather than obtaining a single efficient extreme point as one would normally expect with fixed weights, a cluster of efficient extreme points is typically generated when interval weights are specified. Then, from the subset of solutions generated, it is contemplated, that the decision-maker will be able to qualitatively identify his efficient extreme point of greatest utility (which should either be the decision-maker's optimal point or be close enough to it to terminate the decision process). The procedure presented in this paper involves converting the multiple objective linear programming problem with interval criterion weights into an equivalent vector-maximum problem. Once in such form, an algorithm for the vector-maximum problem can then be used to determine the subset of “efficient extreme” points corresponding to the interval weights specified. General computational experience regarding the operation of the equivalent vector-maximum problem is reported. Also, a numerical example is provided to illustrate the total procedure described.
Equity and Selective Pollution Abatement Procedures
Authors: Carbone R. , Sweigart J. R. 
Published: November 2008

This paper centers on issues of equity which are related to least cost air pollution abatement strategies. Motivation is provided by a hypothetical example based on Knox County, Tennessee data. In this example substantial loss in economic efficiency occurs when all polluters are required to reduce emissions by the same rate, which is a popular kind of equity notion termed a “benchmark” solution. This notion of equity is shown to be equivalent to another which is related to the requirement that each polluter reduce by the proportion that he contributes to total controllable pollutant concentration at points in the region. A new air quality management strategy is suggested which is based on the requirement that polluters who choose to act independently of others must reduce emissions according to the benchmark solution. This strategy provides economic motivation for coalition formation.