bluuebunny/crossref_metadata_2025_split huggingface dataset:
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
Authors: Klingman D. , Napier A. , Stutz J. 
Published: November 2008

The purpose of this paper is to describe the development, implementation, and availability of a computer program for generating a variety of feasible network problems together with a set of benchmarked problems derived from it. The code “NETGEN” can generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems. In addition to generating structurally different classes of network problems the code permits the user to vary structural characteristics within a class. Problems benchmarked on several codes currently available are provided in this paper since NETGEN will also allow other researchers to generate identical problems. In particular, the latter part of the paper contains the solution time and objective function value of 40 assignment, transportation, and network problems varying in size from 200 nodes to 8,000 nodes and from 1,300 arcs to 35,000 arcs.
Health Manpower Systems: An Application of Simulation to the Design of Primary Health Care Teams
Authors: Uyeno Dean H. 
Published: November 2008

A method was developed for the evaluation of alternative primary health care team compositions and for the examination of skill levels for new categories of personnel. This procedure determines the appropriate composition of primary health care teams for differing demand levels and facility availabilities. A simulation model of a general primary health care delivery unit was developed as part of this procedure. This simulation model, given demand schedules, team compositions, and facility levels, produces information relating to the efficiency and effectiveness of that alternative. An application of the simulation model and the evaluation procedure was made to the area of pediatrics. A time study was taken of pediatric office practice. The data gathered therein were analyzed and used to create various demand schedules. Task-capability lists were created for various proposed categories of allied child health personnel, and these personnel were incorporated into various alternative team compositions and tested against varying facility and demand levels. Results indicate there are instances where a team structure is inappropriate and that the first member added to aid the physician is probably a person to assume lower level repetitive tasks.
A Linear Programming Analogue, a Duality Theorem, and a Dynamic Algorithm
Authors: White D. J. 
Published: November 2008

This paper considers fluid analogues for the standard linear programming problem and for a separable nonlinear programming problem. In the former case the usual duality results are demonstrated using the principle of minimum potential energy. In addition by examining the dynamics of the system a new method, referred to as the R-method, is derived for solving linear programmes, although it is not demonstrated that this has any computational advantages over the standard simplex method, except that degeneracy causes no problems. In the nonlinear case the weak Lagrangian principle is derived. The purpose of the paper is to demonstrate that analogue methods, while being impracticable as a physical method of solving optimisation problems, may give some insight into computational algorithms via dual energy concepts and/or dynamic behaviour.
Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
Authors: Newson E. F. Peter 
Published: November 2008

The multi-item lot size problem has been a formal management issue for some decades. The lot size decision of how much to produce (and when) usually considers the trade-off between lost productivity from frequent set-ups and short runs and the higher inventory costs arising from longer runs. When the decision must also consider shared limited production resources, the problem becomes complex. The paper is presented in two parts. Part I outlines a heuristic for solving the multi-item lot size problem given fixed production resources. The problem is initially structured as a network of unlimited capacity. An arc-cutting criterion is suggested, successively paring the unconstrained lot size optimum in low-cost increments until a feasible integer solution occurs. In Part II of this 2 part paper, the heuristic is extended to include variable capacity constraints. Computational results for both the fixed and variable capacity configurations and the bibliography conclude the presentation.
On Management Myth-Information Systems
Authors: Mitroff Ian I. , Nelson John , Mason Richard O. 
Published: November 2008

This paper describes some key defining characteristics of a special class of information systems known as Management Myth-Information Systems (MMIS) or story-telling information systems. MMIS are information systems [Mason, Richard O., Ian I. Mitroff. 1973. A program for research on management information systems. Management Sci. 19 (5, January) 475–487.] which present information to a decision-maker by means of stories. In an MMIS, a scientific datum by itself is not information. In an MMIS, information is information if and only if it is tied to an appropriate story or myth that has meaning to the individual who needs the information, the organization in which he is located, and the type of problem that he faces. This defines the key variables underlying an MMIS. As such, the study of the critical literature dealing with the nature and function of mythology becomes central to the design of MMIS. One of the key purposes of this paper is to suggest how the literature of mythology and the phenomenon of story-telling can be used in the design of MMIS if not for information systems in general. An experiment dealing with some central features of MMIS is described. The experiment involved playing a series of games under the twin conditions of (1) uncertainty and (2) dialectical advice. Experimental subjects were exposed to the advice of two radically opposing “experts of the game” who were designed to present two radically opposing views (“stories”) of the game situation. Finally, a program of research on MMIS is proposed.
Heuristics and Optimizing Techniques Applied to Long Range Facility Planning for Hospital Ancillary Departments
Authors: Vora Jay A. 
Published: November 2008

A conceptual framework for long range facility planning of ancillary departments in hospitals is proposed and successfully applied to a radiology department. The framework involves the interactions of optimizing techniques with heuristics for effective and efficient achievement of an organizational objective. It uses outputs from ad optimizing technique as inputs to a heuristic, and vice versa. This approach does not guarantee an absolute optimal plan, but it does provide the best plan relative to the alternatives developed by following a systematic search within the framework. The proposed framework is adaptable to the organizational needs of health centers, hospitals and other service organizations. It should enhance the understanding of complex planning processes by managers through providing means to separate vital from trivial policy inputs.
Effects of Shop Size and Labor Flexibility in Labor and Machine Limited Production Systems
Authors: Fryer John S. 
Published: November 2008

This paper describes a simulation study that examines the influence of system size and labor flexibility on the performance effects of dispatching and labor control decision rules in labor and machine limited production systems. Four production systems are used—a small job shop, a medium job shop, a large job shop in which workers may be transferred between major organizational divisions, and a large job shop in which workers cannot be transferred between divisions. For each system the decision rules for dispatching and labor control are varied. Comparisons are made of the relative effects of the decision rules, for the different systems, on mean flow-time, flow-time variance and number of worker transfers. Results indicate that the effects of dispatching and labor control decision rules on flow-time measures are consistent for different size and labor flexibility combinations. With one exception, the effects on labor transfer measures are also consistent. Consistency here means that the directions of change in performance measures are the same for the different systems. The magnitudes of both actual and percentage changes do vary for the different systems.
Predicting Changes in Nasa Satellite Contracts
Authors: Stevenson William J. , Berra P. Bruce 
Published: November 2008

Six National Aeronautics and Space Administration (NASA) satellite projects containing twenty-one contracts with approximately 1,000 changes were investigated for the purpose of developing predictive models of contract change incidence which could be used for budgetary and control purposes. Of particular interest were the number, timing, and dollar amounts of changes that can be expected to occur on future contracts. The research indicated that (1) change costs on satellite contracts have negative exponential frequency distributions, (2) contracts within the same project have the same average change costs, (3) the expected number of changes on a satellite contract is a function of the dollar size of the contract and the average project cost/change, and (4) change timing is influenced by many factors which tend to have a confounding effect on changes. A procedure for collecting and analyzing change data and for developing suitable models is outlined. The primary limitations of the models relate to the fact that only NASA satellite contracts were involved and to the availability of a small data base for modeling.
Optimal Theoretic Advertising Stock Models: A Generalization Incorporating the Effects of Delayed Response from Promotional Expenditure
Authors: Mann Don H. 
Published: November 2008

Econometric models of advertising effects incorporating the concept of advertising stock adopt the premise that prior as well as current advertising expenditure affect current sales. In general, stock may be viewed as an intangible demand-generating variable representing an accumulated effect of prior advertising expenditure. One of the weaker assumptions inherent to stock models to date is the specification of the distributed time lag governing the rate at which expenditure flow is manifested into advertising stock: advertising expenditure is assumed to generate maximum response immediately, then decay exponentially over time. This is not only theoretically unappealing, but also empirically dubious as well. Results from recent studies support the more general hypothesis that some time will elapse before the maximum response from advertising expenditure is realized. This paper offers three optimal theoretic models based on modal-delayed or “inverted V” distributed lag functions governing the time relationship between advertising expenditure and sales response. These theoretical models illustrate the implications of a delayed response to advertising expenditure. In particular it is shown that less general models (of the Nerlove-Arrow/Koyck type) overvalue the marginal physical product of advertising, thereby overspecifying the optimal level of advertising stock.
Feasibility of Rent and Tax Incentives for Renovation in Older Residential Neighborhoods
Authors: Curry Clarence F. , Gensch Dennis H. 
Published: November 2008

Can city governments take meaningful actions to relieve the growing shortage of rental housing units for low income families without heavy reliance on state or federal support? To answer this question a net present value model is developed from the viewpoint of the existing landlords. Using this model the municipal policies which optimize the objective function of providing the maximum renovated housing units subject to budgetary constraints are identified by a convex programming algorithm. The empirical application of this approach to a Pittsburgh neighborhood indicates that it is possible to increase the quality and quantity of the rental housing stock while actually increasing the municipal net revenue.
A Multiproduct Inventory System with Interactive Set-Up Costs
Authors: Andres Fred , Emmons Hamilton 
Published: November 2008

We present a branch and bound algorithm for finding the optimal ordering policy for a multiproduct inventory system with deterministic demand, infinite horizon, and no backlogging. Ordering costs are assumed to include a separate set-up cost for each product ordered, but with a fixed savings each time all products are simultaneously ordered. Holding costs accrue at a constant rate per unit of each product. We first restrict our search to policies of a certain type, and then prove several theorems which lead to an efficient algorithm. For the two-product case, a special algorithm is developed to give more precise results than earlier authors.
Evaluation of University Professors' Research Performance
Authors: Jauch Lawrence R. , Glueck William F. 
Published: November 2008

The goal of this study was to compare systematically the multiple measures of research output, both objectively and subjectively, in order to identify those which are effective for evaluation of research professors. The study took place at the University of Missouri where a sample of 86 “hard” science professors pursuing funded research in 23 departments were evaluated. The major conclusion of this research is that effectiveness can be measured by a simple count of the number of publications in respectable journals. But because the researchers and their department chairmen do not believe simple counts to be effective, this should be supplemented by weighting the publications with a journal quality index.
The Generalized Market Area Problem
Authors: Lowe Timothy J. , Hurter Arthur P. 
Published: November 2008

This paper considers the production-transportation problem of a firm with a finite number of production (supply) facilities of known location, facing demand distributed over a subset (market region) of K-dimensional Euclidean space. The demand for a single good is described by a demand density function which is continuous almost everywhere on the market region. Production cost functions exist at each production facility and transport cost functions refer to delivering the good from the production facility to the consumer. The objective is to set production at each production facility and to select a supply policy such that total production and transportation costs are minimized. The problem is formulated in its entirety and later simplified through suboptimization. Necessary conditions for an optimal solution are derived and economic interpretations are provided.
A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop
Authors: Weeks James K. , Fryer John S. 
Published: November 2008

This paper describes a simulation study of the relative impact of due-date assignment, dispatching and labor assignment decision rules on the performance of a hypothetical dual-constrained job shop. Six criteria are used to measure the performance of the decision rules. They are mean flow-time, variance of flow-time, mean lateness, variance of lateness, proportion of jobs late, and total labor transfers. Multiple regression is the principal method of analysis of the results of the experiments. This technique provides regression coefficients and analysis of variance statistics for the decision rules for the various performance measures. Since the objective of this study is to go beyond simple statements of the significance of the various decision rules, the multiple regression results are used with analysis of variance statistics to indicate the relative impact of the decision rules. The regression coefficients and the omega squared (ω2) indices [Hays, W. L. 1962. Statistics. Holt, Rinehart and Winston, New York, 406–408.] indicate that the relative importance of the due-date assignment, dispatching and labor assignment decision rules is dependent upon the measure of performance considered. In addition, the relative importance and optimality of the dispatching rules is dependent upon the due-date tightness for selected performance measures.
Optimal Price and Protection Period Decisions for a Product Under Warranty
Authors: Glickman Theodore S. , Berger Paul D. 
Published: November 2008

This paper proposes and analyzes a model for maximizing the profit of a product sold under warranty. The decision variables assumed in the model are the price of the product and the length of the period throughout which the manufacturer is responsible for service. The paper focuses on the dependence of optimal profit on price and protection period for a realistic and general description of a warrantied product. Failures are stochastic and repairs are of constant cost. Demand depends exponentially on price and warranty duration. After an introduction and literature review, the basic model is presented and assumptions are made about the particular probability law governing product failures. The optimization procedure is then illustrated for certain values of input parameters. Finally, an extensive economic analysis of the sensitivity of the optimal solution to variations in input parameters is provided.
Group Decisions in the Face of Differences of Opinion
Authors: Bacharach Michael 
Published: November 2008

Suppose a number of honest, intelligent individuals differ in their rankings of a set of possible actions. They may do so because they have difierent objectives, or they may do so solely because they disagree about what are the probable outcomes of the acts. The latter is the relevant case if they are acting disinterestedly as consultants. In this case how should the actions be ranked by the executive? Here the essential problem is that of “consensus theory”—to find a reasonable way of resolving the experts' differences of opinion about the facts (the circumstances determining the outcomes). To tackle this problem we enlarge it. We pose the problem mathematically in an abstract form which encompasses a very wide range of hypothetical cases, allowing small and big differences over objectives (utilities) as well as over probability assessments (of the facts). We then look for general rules for generating a group ranking for the acts which would simultaneously satisfy axioms referring to varying extreme cases. On certain assumptions the group ranking of acts implies an underlying consensus about the facts. The object of the paper is to show which axioms of group choice lead to which formulas for consensus. The paper arrives at both positive and negative results. Under two alternative sets of appealing axioms, the group's implicit consensus is given as a linear opinion pool; the consensual probabilities are weighted averages of the individuals' ones. On the other hand, under a third set of reasonable axioms, the group ranking cannot be arrived at by any rules for separately combining the probabilities and combining the utilities. However, this “impossibility” result depends on wanting the rule to work for cases of extreme differences over rankings of acts.
On the Linear Complementarity Problem
Authors: Rao Arza K. 
Published: November 2008

Consider the linear complementarity problem given in the system: [Formula: see text] where, W, Z and q are vectors of dimension n. M is a matrix of order n × n and ZT is the transpose of Z. Any (Z, W) satisfying (1), (2), and (3) is a complementary feasible solution to system (I). In the literature, a class of matrices is defined such that if M belongs to this class, then existence of a feasible solution to system (I) implies the existence of a complementary feasible solution to system (I) with W = 0. In this paper, a new class of matrices 𝔐 is developed. It is shown that membership of a matrix M in 𝔐 is equivalent to the property; for any q existence of a feasible solution to system (I) implies the existence of complementary feasible solution to system (I) for that q with W = 0. This new class of matrices is not contained in any one of the known classes, namely, copositive plus, positive definite or semidefinite, P-matrices, P-matrices, Z-class, etc.
On Risky Investments with Random Timing of Cash Returns and Fixed Planning Horizon
Authors: Perrakis Stylianos , Sahin Izzet 
Published: November 2008

This paper provides a computational technique for the evaluation of the net present value (NPV) of an investment, in which the cash inflows occur at random time points and which terminates after a fixed time interval. The initial cash outlay is deterministic and the magnitudes of the cash inflows are nonnegative random variables with known distributions. The lengths of the intervals between successive cash inflows are independently distributed and independent of the magnitude of the inflows. The Laplace transform of the distribution of the NPV is computed for both cases of mutual independence and perfect correlation of the inflows. It is argued that these distributions are indispensable in determining the accuracy of the manager's estimates and in evaluating actual versus expected performance of a project.
Communication
Authors: Buffa Elwood S. , Scriabin Michael , Vergin Roger C. 
Published: November 2008

(1) “On a Paper by Scriabin and Vergin” by Elwood S. Buffa, Graduate School of Management, University of California, Los Angeles. (Comments on Scriabin, M., R. C. Vergin. 1975. Comparison of computer algorithms and visual based methods for plant layout. Management Sci. 22 (2) 172–181) (2) “Computer and Visual Methods for Plant Layout—A Rejoinder” by Michael Scriabin and Roger C. Vergin, Faculty of Management Sciences, Simon Fraser University, Burnaby, British Columbia, Canada. (Comments about details of Scriabin, M., R. C. Vergin. 1975. Comparison of computer algorithms and visual based methods for plant layout. Management Sci. 22 (2) 172–181 where Buffa [Scriabin, M., R. C. Vergin. 1976. Computer and visual methods for plant layout—a rejoinder. Management Sci. 23 (1) 104] felt were defects in research design)