Open Access. Powered by Scholars. Published by Universities.®
Business Administration, Management, and Operations Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Operations research (644)
- Mathematical optimization (144)
- Algorithms (106)
- Stochastic processes (73)
- Decision making--Mathematical models (71)
-
- Linear programming (71)
- Integer programming (42)
- Queuing theory (38)
- Research and development projects (35)
- Markov processes (34)
- Dynamic programming (33)
- Production scheduling (30)
- Mathematical models (28)
- Resource allocation (28)
- Nonlinear programming (23)
- Branch and bound algorithms (22)
- Computational complexity (22)
- Flexible manufacturing systems (22)
- Inventory control (22)
- Simulation methods (22)
- Computer simulation (21)
- Industrial management (21)
- Manpower planning (19)
- Programming (Mathematics) (19)
- Queueing theory (17)
- Delphi method (16)
- Dental offices--Management (16)
- Heuristic algorithms (16)
- Inventory control--Mathematical models (16)
- Production management (16)
- Publication Year
Articles 571 - 600 of 645
Full-Text Articles in Business Administration, Management, and Operations
An Introductory Survey Of Integer Linear Programming, Milton E.F. Schoeman
An Introductory Survey Of Integer Linear Programming, Milton E.F. Schoeman
Research Reports from the Department of Operations
Researchers have concentrated great effort in recent years in the area of integer linear programming. This survey paper is intended as an introduction to some of this work with emphasis on its application to the project selection problem. The techniques outlined may be classified into three groups: (1) cutting plane methods; (2) partial enumerative or combinatoric methods; (3) efficient (suboptimal) heuristic methods. General descriptions of methods in each of these classifications are given along with an indication of their relative computational efficiency. Finally, some insight is given towards the future direction of efforts in this area, which would also provide …
Project Selection Under Cost And Payoff Value Uncertainties, Burton V. Dean, T.S. Chidambaram, R.R. Palanki
Project Selection Under Cost And Payoff Value Uncertainties, Burton V. Dean, T.S. Chidambaram, R.R. Palanki
Research Reports from the Department of Operations
This paper considers a stochastic version of the project selection model (Model T in Dean and Hauser, "Advanced Material Systems Planning", IEEE Transactions on Engineering Management, March 1967), where $C has to be allocated among n technical approaches so that the probability of at least one approach being successfully completed is maximized. The cost of the ith approach, ci, is a random variable with distribution function, while the probability of success is, in general, a function P^(ct) of the cost. A dynamic programming formulation has been given to solve this problem assuming that the budget allocated to one approach cannot …
A Numerical Method For Constructing Tables For The Behavior Of Some Infinite Queueing Systems, U. Narayan Bhat, Stuart H. Mann
A Numerical Method For Constructing Tables For The Behavior Of Some Infinite Queueing Systems, U. Narayan Bhat, Stuart H. Mann
Research Reports from the Department of Operations
The need for the construction of tables of transition probabilities in the study of the behavior of queueing systems is discussed and general procedure of the preparation of such tables for the imbedded Markov chain analysis of the systems M/G/1 and G/M/1 is illustrated with the queue M/D/1. Two new measures of utilization and effectiveness are also proposed in the general context.
Transient Behavior Of Multi-Server Queues With Recurrent Input And Exponential Service Times, U. Narayan Bhat
Transient Behavior Of Multi-Server Queues With Recurrent Input And Exponential Service Times, U. Narayan Bhat
Research Reports from the Department of Operations
This paper addresses challenges in analyzing multi-server queues with recurrent input and exponential service times, where departure rates depend on server availability. Previous studies established equilibrium behavior for GI/M/s systems, focusing on imbedded Markov chains and long-term behavior. However, time-dependent behavior has only been explored for specific interarrival distributions or limited cases, such as s=2,3. General studies on waiting times emphasize equilibrium solutions but leave gaps in simpler methods applicable to GI/M/s systems. This paper seeks to address this gap by developing approaches for transient behavior, extending the understanding of queue dynamics beyond equilibrium states.
A Study Of The Queueing Systems M/G/1 And Gi/M/1, U. Narayan Bhat
A Study Of The Queueing Systems M/G/1 And Gi/M/1, U. Narayan Bhat
Research Reports from the Department of Operations
This report examines single-server queueing systems, focusing on M/G/1 (Poisson arrivals with general service times) and GI/M/1 (general independent arrivals with negative exponential service times). Traditional approaches, often relying on transforms to analyze distributions, have been criticized for obscuring key behavioral details. The report explores more recent advancements and research in queueing systems. The author presents a simplified method for studying queueing systems that minimizes the use of transforms while maintaining analytical rigor, making it well-suited for teaching and practical applications. The report extends its applicability to systems with group arrivals and services, using Kendall’s notation to denote queue configurations.
Mathematical Programming With Monotonic Constraint Functions, William P. Pierskalla
Mathematical Programming With Monotonic Constraint Functions, William P. Pierskalla
Research Reports from the Department of Operations
The mathematical programming problem -- find a non-negative n-vector x which maximizes f(x) subject to the constraints g^i(x) ≥ 0, i = 1,...,m -- is investigated where f(x) is assumed to be concave or strictly quasi-concave and the g^i(x) are monotonic increasing functions. It is shown that under certain conditions on g^i(x), the Kuhn-Tucker-Lagrange conditions are necessary and sufficient for the optimality of x*. It is also shown that the g^i(x) are an interesting class of functions since, among other properties, they are closed under non-negative addition, under the addition of any scalar, and under multiplication of non-negative members of …
A Model For Evaluating Costs Of Implementing Community Projects, Burton V. Dean, Samuel J. Mantel Jr.
A Model For Evaluating Costs Of Implementing Community Projects, Burton V. Dean, Samuel J. Mantel Jr.
Research Reports from the Department of Operations
As a contribution to the difficult problem of estimating costs and benefits for community projects, a model is developed which estimates the expected costs of implementation of projects that face community group opposition. The essential elements in the model are the careful enumeration of the opposition groups in a community and a classification and measurement of factors that are important in determining the magnitude and extent of opposition. The model includes the costs and risks of community project implementation, the relative importance of factors and groups, and the decision criteria used by the groups. A method of solution, examples, and …
Scheduling Vehicles In A Transportation Network, Roy Macdonald-Taylor
Scheduling Vehicles In A Transportation Network, Roy Macdonald-Taylor
Research Reports from the Department of Operations
The problem of scheduling vehicles in a transportation network consisting of the straight line with the two main stations at each and intermediate stations in between was investigated. The proposed high speed ground transport system in the northeast corridor between Boston and Washington was used as an example. The tool used was simulation on a computer and the basic approach was to develop scheduling decision rules, develop criteria to measure the effectiveness of the rules, apply the rules and evaluate the resultant schedules in terms of the measures of effectiveness. Some general and particular case conclusions are drawn.
Business Games, Programmed Players, And Individual Decision-Making Profiles, John M. Braasch
Business Games, Programmed Players, And Individual Decision-Making Profiles, John M. Braasch
Research Reports from the Department of Operations
The area of investigation of this study was that of the use of a business decision simulation to determine profiles of decision-making skill and style of students in business administration. The objective of this research was to determine relationships between the educational background and training of business administration students, and their proficiency in decision-making, together with their basic modes of decision-making. The research program involved the use of a new computer-programmed general management business decision simulation which simulates an interacting, multi-firm industry which was designed primarily for teaching and research purposes. The technique used in this study revolved around the …
Two-Class Priority System With Setup Times, Peter Mevert
Two-Class Priority System With Setup Times, Peter Mevert
Research Reports from the Department of Operations
This paper analyzes a single-server queuing system with two classes of customers. Service is provided on a first-come, first-served basis within each class, with three priority disciplines considered: preemptive head-of-line, alternating between classes, and standard first-come, first-served. A setup or orientation time is incurred whenever the server switches from one class to another. Customer arrivals follow a Poisson process, while service and setup times are governed by arbitrary distributions. Using modifications of the virtual waiting time method, the study derives Laplace transforms and expected values for the steady-state waiting time distributions under the three priority disciplines. Special cases are also …
An Additive Algorithm For Solving The Multi-Dimensional Assignment Problem, William P. Pierskalla
An Additive Algorithm For Solving The Multi-Dimensional Assignment Problem, William P. Pierskalla
Research Reports from the Department of Operations
An algorithm is proposed for the solution of the multi-index assignment problem. The algorithm is based on a tree search technique of the branch and bound variety. It uses dual subproblems to provide easily computed bounds for the primal assignment problem.
The Tri-Substitution Method For Obtaining Near-Optimal Solutions To The Three-Dimensional Assignment Problem, William P. Pierskalla
The Tri-Substitution Method For Obtaining Near-Optimal Solutions To The Three-Dimensional Assignment Problem, William P. Pierskalla
Research Reports from the Department of Operations
In a previous paper we presented an algorithm which will find the optimal solution to the multi-index assignment problem. That algorithm was based on branch and bound techniques and the search was performed over the entire tree of feasible solutions. It is not felt that that algorithm will be particularly efficient for certain large multi-dimensional assignment problems. Thus, we now present a method which will achieve a close-to-optimal (if not the optimal) solution in a reasonable amount of time for moderately large three-index assignment problems.
A Research Laboratory Performance Model, Burton V. Dean
A Research Laboratory Performance Model, Burton V. Dean
Research Reports from the Department of Operations
A mathematical model is developed for measuring and evaluating the performance of a research laboratory in meeting the needs to develop items that satisfy stated Army operational requirements. Three submodels are developed, with the overall laboratory model obtained through matrix multiplication. Illustrative examples have been created using Army research laboratory data. The model may be modified to include stochastic variables and data on the relative importance of projects and sciences.
Prepaid Dental Plans: Data Collection And Analysis Procedures Ii, John M. Braasch, Burton V. Dean, U. Narayan Bhat
Prepaid Dental Plans: Data Collection And Analysis Procedures Ii, John M. Braasch, Burton V. Dean, U. Narayan Bhat
Research Reports from the Department of Operations
This report covers the research activities concerned with developing procedures for the External Design of Prenaid Dental Plans, for the period of February, 1966 through September, 1966. This second stage was concerned with analyzing the relationships between plan member socio-economic background data and specific dental service utilization data for dental plans, with differing financial, organizational structure, and benefit levels. This report discusses the mathematical models and statistical procedures, data collection procedures, the characteristics and quality of the data collected, the computer-programmed statistical programs obtained, and current and future activities and problems.
Advanced Materiel Systems Planning, Burton V. Dean, Lawrence E. Hauser
Advanced Materiel Systems Planning, Burton V. Dean, Lawrence E. Hauser
Research Reports from the Department of Operations
This report is concerned with the development of mathematical models, computer programs, and data requirements to conduct development systems planning in large Research and Development organizations. The specific planning decision problems are (1) the selection of technical alternatives, (2) the funding of system components and (3) the funding of systems. Cost-effectiveness relationships are developed. A manual is presented for use in the training of planners in the utilization of computer results. Tests have been conducted utilizing simulated cost, risk, and value data. A Study Performed for the Office of Naval Research (ONR), Army Materiel Command (AMC), Department of Defense, Washington, …
Optimal Allocation Of Shunt Capacitors On A High-Voltage Transmission System, William A. Mccuskey
Optimal Allocation Of Shunt Capacitors On A High-Voltage Transmission System, William A. Mccuskey
Research Reports from the Department of Operations
The basic allocation procedure and the cycling procedure outlined above are tools which hopefully will be useful to the utility in its system planning. More research is necessary to (1) extend the present method to a full- scale optimization and (2) extend and modify the procedures to consider trade- offs in cost of capacitor allocation over time. The ultimate goal would be to develop a procedure which optimally planned both capacitor and generation capacity increases over a number of years. The procedures presented here are a step toward this goal.
An Annotated Bibliography On Corporation R And D Project Evaluation And Selection Techniques, Burton V. Dean, Vinod Krishna
An Annotated Bibliography On Corporation R And D Project Evaluation And Selection Techniques, Burton V. Dean, Vinod Krishna
Research Reports from the Department of Operations
This bibliography surveys the published literature on quantitative techniques in use by industry for solving R and D project evaluation and selection problems. Published literature on company technique has been surveyed. It has not been our purpose to analyze theoretical techniques, but rather to identify company procedures that have been reported to be in use .
A Method For Analyzing Urban Transportation Plan Implementation Problems, Burton V. Dean, Samuel J. Mantel Jr., Nathan D. Grundstein
A Method For Analyzing Urban Transportation Plan Implementation Problems, Burton V. Dean, Samuel J. Mantel Jr., Nathan D. Grundstein
Research Reports from the Department of Operations
This report describes a six month study performed jointly by Case Institute of Technology and Western Reserve University under the sponsorship of the Cleveland-Seven County Transportation Land Use Study (SCOTS). The specific research problem studied by the team, as defined by SCOTS, is how to obtain the cooperation of municipalities to solve regional transportation problems. The relative importance of this problem can best be stated by referring to a statement made by President Lyndon Johnson. This study is concerned with developing a quantitative approach towards analyzing social change in a technological activity - urban transportation. We consider that an urban …
Discretionary Priority Processes, Maximilian Etschmaier
Discretionary Priority Processes, Maximilian Etschmaier
Research Reports from the Department of Operations
Single server queuing systems are considered where two populations with different priority indices emanate from infinite sources and request service. The service times are independent random variables drawn from two different distributions. The actual service time requirement is only known upon completion of the service. The discipline followed is such that a low priority customer is preempted upon arrival of a high priority customer only if the elapsed service time is less than z. If the elapsed service time is more than z, the high priority customer waits until the completion of the service. Optimal values of z are obtained …
Inventory Control Of A Multiproduct System With Interacting Procurement Cost, B. D. Sivazlian
Inventory Control Of A Multiproduct System With Interacting Procurement Cost, B. D. Sivazlian
Research Reports from the Department of Operations
The characteristics of a multiproduct, multiwarehouse periodic review inventory system in which interdependency between commodities and/or warehouses is introduced through set-up costs, are investigated for probabilistic demand. For a two-commodity system, the one and two period problems are analyzed. By specifying the structure of the inventory policy, the statistical properties of the system can be studied and optimal decision rules arrived at. For the stationary problem, the fundamental equation dealt with is similar to the basic renewal equation, though one is dealing rather with vector random variables. Concepts in mapping, differential and variational calculus are used in working out the …
Sales And Restocking Policies In A Single Item Inventory System, Richard V. Evans
Sales And Restocking Policies In A Single Item Inventory System, Richard V. Evans
Research Reports from the Department of Operations
A single product inventory system with linear costs is considered when customers are of two different types. Penalty costs for lost sales differ for the two types of customers and, therefore, optimal system control requires different shortage probabilities for the two classes. In one case, high penalty customers independently arrive while at the other extreme it is assumed that there is only one such customer. Single critical number policies are optimal in the simple situations. If the priority type customers become active and register displeasure by changing their demand pattern when their demands are not satisfied, simple convexity or Polya …
An Algol Program To Solve The Linear Programming Problem : Using The Revised Simplex Method, Bruce A. Powell
An Algol Program To Solve The Linear Programming Problem : Using The Revised Simplex Method, Bruce A. Powell
Research Reports from the Department of Operations
An Algol computer. program to solve the linear programming problem is given. The program is based upon an updated version of the Algol procedure of Clasen and has been run on the Case-Univac 1107 computer. The program has been found to be efficient on a large number of problems.
Minnesota General Management Simulation Model, John M. Braasch
Minnesota General Management Simulation Model, John M. Braasch
Research Reports from the Department of Operations
This paper presents the basic, underlying mathematical model of the Minnesota General Management Simulation. The paper, "Minnesota General Management Simulation," which describes this simulation, and includes the Participant Instructions and Administrative Instructions, is reproduced in the Appendix. Also included in the Appendix is a listing of the FORTRAN program of the simulation. Thus, this paper is also the most complete documentation of the simulation available. On the other hand, the heavy usage of the simulation at the School of Business Administration, University of Minnesota, has caused and may cause changes in both the model and the data-handling section, especially in …
Optimizing Models Of After Tax Earnings Incorporating Depletion Allowances, Daniel Teichroew, Kevin Rice, Gordon P. Wright, William G. Lesso
Optimizing Models Of After Tax Earnings Incorporating Depletion Allowances, Daniel Teichroew, Kevin Rice, Gordon P. Wright, William G. Lesso
Research Reports from the Department of Operations
Optimization problems in the extractive industries differ from that in other industries in that these industries are permitted to claim a tax allowance for depletion of natural resources. This depletion allowance must be calculated for each mining property separately, based on a relatively complex formula specified in the Internal Revenue Code. The problem of optimizing after-tax earnings for a firm with more than one mine is formulated under the following conditions: constant unit price, linear cost function, no annual change in inventory level and a fixed tax rate. The pre-tax and after-tax earnings functions under these assumptions are piecewise linear. …
The Alternating Queuing Process With Setup Times, Peter Mevert
The Alternating Queuing Process With Setup Times, Peter Mevert
Research Reports from the Department of Operations
Stationary Poisson arrivals from two classes are served by a single server. The customers of the same class are served until no more customers of this class are in the system. The service facility is then switched to serve all customers of the other class and switched again when empty. Service and switch-over times have arbitrary distributions. In this paper the moments of the busy periods and the queue sizes at switching point are obtained and the Laplace transform and expected value of the waiting time for each class. Some special cases are considered in detail.
Administrative Computer Programs For General Management Games, John M. Braasch
Administrative Computer Programs For General Management Games, John M. Braasch
Research Reports from the Department of Operations
One frequent complaint of administrators of Business Decision Games has been the lack of computer-programmed routines for use in administering the games—routines which could calculate and print out reports such as Income Statements, Balance Sheets, and Summary Reports covering several simulated periods (such as an Annual Report) for the use of both the administrator and the participants. In addition, these routines could analyze the firms' results in order to facilitate the teaching or research aspects of the games. The purpose of the research described herein was to develop Fortran programs which will perform as indicated above. These programs are designed …
Cost Analyses In Representative Metropolitan Transportation Studies, Burton V. Dean, Hillel Jeremy Kumin
Cost Analyses In Representative Metropolitan Transportation Studies, Burton V. Dean, Hillel Jeremy Kumin
Research Reports from the Department of Operations
The Case Operations Research Group, under sponsorship of the Seven County Transportation Study (SCOTS), has been engaged in a study of the social costs and economic benefits associated with metropolitan transportation systems. The purpose of this study is to determine the relevant factors affecting the implementation of plans resulting from transportation studies. As part of the study, this report is concerned with a survey of the reported cost analyses in five representative metropolitan transportation studies, - Los Angeles, Pittsburgh, Detroit, Washington, D. C., and San Francisco. However, (1) no extensive benefit analyses were performed in the above studies on alternative …
Inventory Depletion Management With Stochastic Field Life Functions, William P. Pierskalla
Inventory Depletion Management With Stochastic Field Life Functions, William P. Pierskalla
Research Reports from the Department of Operations
Most inventory depletion analysis has been concerned with the case of a deterministic field life function. Since it is rarely the case that the exact field life function of a stock of items would be known, it is more reasonable to treat the case where the field life of an item is a random variable X(S) which depends only on the age, S, of the item upon issuance. In this stochastic case, it is shown that the policy of issuing the oldest item first (FIFO) is optimal provided E[X(S)] = aS + b where a > 0, b > 0, i.e., where …
Optimal Issuing Policies In Inventory Management -- Ii, William P. Pierskalla
Optimal Issuing Policies In Inventory Management -- Ii, William P. Pierskalla
Research Reports from the Department of Operations
We are concerned with further generalizations of the inventory depletion model where the inventory deteriorates in time as it remains on the shelf. Once put in use, an item from the inventory of n items has a nonnegative field life, L(s), which is a function of the age, s, of the item upon issuance to the field. The objective is to determine the order of issue that maximizes the total field life of the stockpile. Optimal policies of the form LIFO, last in first out, or FIFO, first in first out, are sought. Earlier writers have considered a static model …
Finite-Source Priority Queues, N. K. Jaiswal, K. Thiruvengadam
Finite-Source Priority Queues, N. K. Jaiswal, K. Thiruvengadam
Research Reports from the Department of Operations
The effect of assuming priorities in multiple finite-source queuing models is studied in which k ≥ 2 types of units emanate from independent sources, at least one of which is finite. Results are derived for k = 2, assuming preemptive resume, repeat and head-of-the-line priority disciplines. Extensions for k > 2 are pointed out.