Open Access. Powered by Scholars. Published by Universities.®
Business Administration, Management, and Operations Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Leadership (5)
- Social and Behavioral Sciences (5)
- Business and Corporate Communications (4)
- Entrepreneurial and Small Business Operations (4)
- Human Resources Management (4)
-
- Organizational Behavior and Theory (4)
- Finance and Financial Management (3)
- Communication (2)
- Corporate Finance (2)
- Industrial and Organizational Psychology (2)
- International Business (2)
- Management Information Systems (2)
- Marketing (2)
- Organizational Communication (2)
- Psychology (2)
- Public Affairs, Public Policy and Public Administration (2)
- Advertising and Promotion Management (1)
- Business Law, Public Responsibility, and Ethics (1)
- Constitutional Law (1)
- Curriculum and Instruction (1)
- Education (1)
- Infrastructure (1)
- Interpersonal and Small Group Communication (1)
- Labor Relations (1)
- Law (1)
- Law and Economics (1)
- Medicine and Health Sciences (1)
- Nonprofit Administration and Management (1)
- Keyword
-
- Operations research (644)
- Mathematical optimization (144)
- Algorithms (106)
- Weatherhead School of Management (75)
- Stochastic processes (73)
-
- Decision making--Mathematical models (71)
- Linear programming (71)
- Integer programming (42)
- Leadership (41)
- Queuing theory (38)
- Research and development projects (37)
- Markov processes (34)
- Dynamic programming (33)
- Management (30)
- Production scheduling (30)
- Mathematical models (28)
- Resource allocation (28)
- Decision making (27)
- Industrial management (23)
- Nonlinear programming (23)
- Branch and bound algorithms (22)
- Computational complexity (22)
- Flexible manufacturing systems (22)
- Inventory control (22)
- Organizational behavior (22)
- Simulation methods (22)
- Computer simulation (21)
- Entrepreneurship (19)
- Manpower planning (19)
- Programming (Mathematics) (19)
- Publication Year
- Publication
- Publication Type
Articles 1081 - 1110 of 1196
Full-Text Articles in Business Administration, Management, and Operations
Some Queueing Systems With Mixed Disciplines, U. Narayan Bhat
Some Queueing Systems With Mixed Disciplines, U. Narayan Bhat
Research Reports from the Department of Operations
Queue length and waiting time processes in transient and steady states are studied in the following single server queueing models: customers arrive in a Poisson process, register in the order of their arrival and form groups of a constant size, say k. (1) customers are selected for service at random from the group at the head of the queue and the service times have a general distribution. (2) customers belonging to a group are ordered according to the length of service they demand and served in this order starting with the one with the shortest service (or with the longest …
Some Aspects Of Queueing Theory And Its Applications, U. Narayan Bhat
Some Aspects Of Queueing Theory And Its Applications, U. Narayan Bhat
Research Reports from the Department of Operations
This paper examines the state of queueing theory research, inspired by Saaty’s 1966 critique of the field’s lack of practical application despite substantial theoretical advancements. Acknowledging the limited progression in applied queueing solutions since Morse’s foundational work in 1958, the discussion attributes this gap to insufficient communication between theoretical researchers and applied scientists. The study organizes its review into three critical problem areas: behavioral, statistical, and optimization aspects of queueing systems. Each area is explored with historical context, highlighting trends, contributions, and deficiencies in the literature. Exceptions where optimization and simulation approaches have advanced practical applications are noted. The paper …
An Inventory Problem With Obsolescence, William P. Pierskalla
An Inventory Problem With Obsolescence, William P. Pierskalla
Research Reports from the Department of Operations
A stochastic single product convex cost inventory problem is considered in which there is a probability, πj, that the product will become obsolete in the future period j. In an interesting paper Barankin and Denny essentially formulate the model but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into …
Annotated Bibliography On Methods For Evaluating Basic Research Projects, J. Bruce Davis
Annotated Bibliography On Methods For Evaluating Basic Research Projects, J. Bruce Davis
Research Reports from the Department of Operations
This document is an annotated bibliography on literature about evaluating basic research projects.
An Annotated Bibliography: Cost Analysis, Donald C. Friedel
An Annotated Bibliography: Cost Analysis, Donald C. Friedel
Research Reports from the Department of Operations
This document provides a summary of cost analysis and an annotated bibliography on cost analysis literature.
The Multidimensional Assignment Problem, William P. Pierskalla
The Multidimensional Assignment Problem, William P. Pierskalla
Research Reports from the Department of Operations
The multidimensional assignment problem is a higher dimensional version of the standard (two-dimensional) assignment problem in the literature. The higher dimensions can be thought of as time or space dimensions or both. 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.
An Annotated Bibliography On The Management Of Research And Development, Jon L. Bushnell, Chandrasekhar Das, Alfred R. Michenzi, Allan L. Service
An Annotated Bibliography On The Management Of Research And Development, Jon L. Bushnell, Chandrasekhar Das, Alfred R. Michenzi, Allan L. Service
Research Reports from the Department of Operations
The Bibliography was prepared as a part of the Case Western Reserve University Program of Research on Research Management. The Program is a joint effort of the School of Management and the Division of Special Interdisciplinary Studies and is supported by the Department of Defense as a part of Project Themis. In this work, emphasis has been placed on currently useful methods of R & D management, particularly cost-effectiveness and systems analysis. Other methods have also been considered, but the Bibliography is not designed to be comprehensive. It was decided, however, that since the Program is a continuing one, a …
Analysis Of A Multistage Inventory Task -- Comments On A Paper Of Amnon Rapoport, William P. Pierskalla
Analysis Of A Multistage Inventory Task -- Comments On A Paper Of Amnon Rapoport, William P. Pierskalla
Research Reports from the Department of Operations
In an interesting paper in Behavioral Science, Volume 12 (1967) Professor Amnon Rapoport reported on his tests of the dynamic decision making capabilities of a group of students. He found that the students did not perform well relative to the normative results predicted by two quantitative inventory models he had chosen. It is the purpose of this paper to point out that the wrong normative models were chosen and that if the appropriate inventory model is picked, the students actually performed reasonably well.
Optimality Of Full-Funding Strategies In R & D Allocation Problems, T. S. Chidambaram
Optimality Of Full-Funding Strategies In R & D Allocation Problems, T. S. Chidambaram
Research Reports from the Department of Operations
$C is to be allocated among n "approaches" such that the expected probability of successful completion of at least one of the n approaches is maximized. The ith approach involves a cost ci which is a random variable with probability density function $\i_ and has a probability P_i(c_i) of success. Faced with this uncertainty in cost, the R & D manager can either: a) Choose a large number of approaches to support but allocate to them small amount of money or b) Choose a small number of approaches to support but allocate to them large amount of money. This allocation …
Parking Space Allocation And Long Range Planning, Burton V. Dean, Stuart H. Mann, Fu-Tong Hsu, Murray Davidson, Alfred R. Michenzi, Chandrasekhar Das
Parking Space Allocation And Long Range Planning, Burton V. Dean, Stuart H. Mann, Fu-Tong Hsu, Murray Davidson, Alfred R. Michenzi, Chandrasekhar Das
Research Reports from the Department of Operations
This study presents an analysis of parking system characteristics at twenty-eight institutions that are comparable in size and scope to that of Case Western Reserve University and the University Hospitals. The question of whether universities charge for parking, the magnitude of such fees for permit holders and visitors, and the use of variable fee policies are investigated. The comparative performance of university parking systems are tabulated in terms of the relative number of permits issued for off- street parking, the relative number of parking spaces that are provided, and the utilization of parking spaces by permit holders. Finally, development costs …
Queuing Systems With Enforced Idle Time, Bruce A. Powell, Benjamin Avi-Itzhak
Queuing Systems With Enforced Idle Time, Bruce A. Powell, Benjamin Avi-Itzhak
Research Reports from the Department of Operations
Enforced idle time occurs in any queuing system in which it is possible for the server to be idle and the queue length to be nonzero simultaneously. This paper examines queuing systems in which the server is conktrained to start service only at fixed intervals of time, with arrivals of customers and service completions occurring continuously. The GIIM/N, GI/D/N, M/D/N,and GI/G/1 queuing systems with enforced idle time are studied and some closed form steady-state results are presented. An application to railroad cfir pool systems is suggested.
Mathematical Programming With Increasing Constraint Functions, William P. Pierskalla
Mathematical Programming With Increasing 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ᵢ(x) ≥ 0, i = 1,...,m — is investigated where f(x) is assumed to be concave or pseudo-concave and the gᵢ(x) are increasing functions. It is shown that under certain conditions on gᵢ(x), the Kuhn-Tucker-Lagrange conditions are necessary and sufficient for the optimality of x*. It is also shown that the gᵢ(x) are a useful 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 the class. Examples of …
Optimal Policies For Two Product Inventory Systems With Negotiable Lead Times, Gordon P. Wright
Optimal Policies For Two Product Inventory Systems With Negotiable Lead Times, Gordon P. Wright
Research Reports from the Department of Operations
Two product periodic review dynamic inventory models are considered. At the start of each period two decisions are made for each product. How much to "normal order" with a lead time of λn periods and how much to "emergency order" with a lead time of λe periods, where λe < λn. It is assumed that the emergency ordering costs are higher than the normal ordering costs for each product. Demands in the periods are independent vector random variables with known probability density functions. Demands for individual products within a period are assumed to be non-negative, but they need not be independent. Whenever demand exceeds inventory, their difference is backordered rather than lost. The optimal ordering policy is characterized for three models. The first model is one that incorporates two revenue functions; that is, a salvage return function and a credit function. Also, a linear constraint is imposed on both products which restricts the amount that can be obtained by emergency ordering. The second model considers the case where there is a linear resource constraint which limits the total amount that can be produced or ordered for both products, both normal and emergency, during the normal lead time. The third model is one which is representative of inventory systems having limited storage capacities. There is a linear constraint on the total amount that can be stored for both products during the normal replenishment period. The second and third models discussed do not incorporate a salvage gain function or a credit function.
Priority Problems In Inventory Control, Bruce A. Powell
Priority Problems In Inventory Control, Bruce A. Powell
Research Reports from the Department of Operations
A priority problem exists whenever a system differentiates between distinct classes of customers. Some dynamic, stochastic, periodic review inventory models are developed and analyzed under the assumption that a single customer will accept delivery of an order only if the order can be filled from on-hand inventory. Optimal policies are studied, and conditions under which the form of the optimal dynamic policy is a nondecreasing sequence of single critical numbers are presented. An extensive set of numerical examples suggest that the major factor in determining the form of the optimal policy is the function ~~(~) where ~ is the demand …
An Annotated Bibliography: Applications Of Operations Research To Educational Systems, Warren L. Balinsky
An Annotated Bibliography: Applications Of Operations Research To Educational Systems, Warren L. Balinsky
Research Reports from the Department of Operations
This document is an annotated bibliography on applications of operations research to educational systems.
Analysis Of Job Shop Scheduling Research Alternatives, Yoshiro Kuratani, Burton D. Corwin
Analysis Of Job Shop Scheduling Research Alternatives, Yoshiro Kuratani, Burton D. Corwin
Research Reports from the Department of Operations
This technical memorandum is prepared as a report on the job shop scheduling research activities conducted for the Babcock and Wilcox Company (B & W) during the period from March, 1967, to May 31, 1967, by Yoshiro Kuratani and Burton Corwin under the contract number 342-1533 and also on the activities by Burton Corwin during the summer, 1967, while he was employed at the B & W’s Research Center, Alliance, Ohio. The activities center around (1) a survey of the literature, (2) interviews with experts, (3) presentation of a seminar, (4) construction of a job shop model and validation of …
Estimation Of Research Contract Awards, Burton V. Dean, Stuart H. Mann
Estimation Of Research Contract Awards, Burton V. Dean, Stuart H. Mann
Research Reports from the Department of Operations
Decision problems in R and D management need to be investigated in order to improve the existing methods in this field. Through the construction and solution of mathematical models we may translate management objectives and constraints into policies that involve optimal decisions. It is the intention of the authors to present in this paper the results of a study conducted to improve the decision making capabilities of R and D management in the area of contract awards. This technical memorandum is intended for companion use with "A Management Control System for Estimating Research and Development Manpower Requirements", Case Institute of …
The Multi-Dimensional Assignment And Quadratic Assignment Problems, William P. Pierskalla
The Multi-Dimensional Assignment And Quadratic Assignment Problems, William P. Pierskalla
Research Reports from the Department of Operations
The multi-dimensional assignment problem is a higher dimensional version of the standard (two-dimensional) assignment problem in the literature. The higher dimensions can be though of as time or space dimensions or both. 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 same algorithm with appropriate modifications is used to find an optimal solution to the multi-dimensional quadratic assignment problem.
Cleveland Heights And The Lee Freeway : A Study Of Collective Opinion And Knowledge In Relation To Characteristics Of The Populace, J. Brunelle, V. D'Alessandro Jr., J. Dido, R. Drees, M. Kaplan
Cleveland Heights And The Lee Freeway : A Study Of Collective Opinion And Knowledge In Relation To Characteristics Of The Populace, J. Brunelle, V. D'Alessandro Jr., J. Dido, R. Drees, M. Kaplan
Research Reports from the Department of Operations
This study is based on a survey conducted in Cleveland Heights, an eastern suburb of Cleveland, Ohio, in which 255 residents and fifty professionals were interviewed regarding their knowledge and opinions of the proposed Lee Freeway. Knowledge and opinion of those interviewed were determined and compared with distance from the proposed freeway route, length of residence, and number of children living at home. A list of advantages and disadvantages was also compiled from each interview. On the basis of this data, opposition to the Lee Freeway was found to be inversely related to the distance from the freeway. Strength of …
Prepaid Dental Plans: Preliminary Data Analysis Iii, U. Narayan Bhat, Burton V. Dean, Arvindlal A. Shah
Prepaid Dental Plans: Preliminary Data Analysis Iii, U. Narayan Bhat, Burton V. Dean, Arvindlal A. Shah
Research Reports from the Department of Operations
Under continuing research, a preliminary analysis of data collected on costs and utilization of prepaid dental plans is reported here. Findings of this investigation include empirical results regarding the measured influence of membership socio-economic variables on the utilization of dental services offered by the plans and the significance of such plan variables as financial structure, organizational structure, membership size and the geographical location of the plan.
Ladder Variables In Queueing Theory, N.U. Prabhu
Ladder Variables In Queueing Theory, N.U. Prabhu
Research Reports from the Department of Operations
In the present survey, we follow the treatment given by Feller (1966). In Sections 2 and 3, we develop the basic results concerning the ladder processes arising from a general one-dimensional random walk. In Section 4, we apply these results to the waiting time in a single-server queue, with details worked out for the two cases where (i) the arrivals are Poisson, and (ii) service times are exponentially distributed. In Section 5, these two systems are again considered, and the concepts of Sections 2 and 3 are used to investigate the number of customers present in each system at certain …
Long Range Corporate Planning Model For Major Capital Investments, William G. Lesso
Long Range Corporate Planning Model For Major Capital Investments, William G. Lesso
Research Reports from the Department of Operations
A model of major capital investments is developed for a firm with several existing production facilities and a number of alternatives for investment in new facilities. The model extends previous capital investment models by using discounted after tax earnings as the objective function, by determining the benefits of an alternative through optimum allocation of demand among facilities for each period and by permitting the use of retained earnings and borrowings (which are limited by past investments and earnings). The algorithm provides an optimal solution for much larger problems than could be handled with present day computer equipment using non-linear integer …
Piecewise Linear Concave Ordering Cost Functions In Inventory Theory, Evan L. Porteus
Piecewise Linear Concave Ordering Cost Functions In Inventory Theory, Evan L. Porteus
Research Reports from the Department of Operations
The analysis of single product, periodic review, dynamic inventory models has constituted an important part of the Operations Research literature since 1951, when Arrow, Harris, and Marshak introduced them. Periodically, the level of inventory of a single item is examined and a decision made as to whether to order or not, and if to order, how much to order. This decision is made with the intention of minimizing the expectation of the relevant costs to be incurred over a given planning horizon consisting of more than one period. The relevant costs usually consist of the costs attributable to ordering, holding, …
On A Basic Research Cost Effectiveness - Resource Allocation Model, Burton V. Dean, Samuel J. Mantel Jr.
On A Basic Research Cost Effectiveness - Resource Allocation Model, Burton V. Dean, Samuel J. Mantel Jr.
Research Reports from the Department of Operations
This paper develops a preliminary model for use in allocating funds for mission oriented basic research in a government agency. Three submodels are developed - (1) a cost model for estimating the costs of basic research tasks, (2) a linkage model for relating the performance of basic research and subsequent utilization of basic research results in systems and component development, and (3) a value model for estimating the effectiveness of basic research tasks. A cost-effectiveness relationship is developed for use in relating the cost and benefits of basic research programs and tasks. Research allocation models are developed for use under …
A Management Control System For Estimating Research And Development Manpower Requirements, Burton V. Dean, Stuart H. Mann, Burton D. Corwin
A Management Control System For Estimating Research And Development Manpower Requirements, Burton V. Dean, Stuart H. Mann, Burton D. Corwin
Research Reports from the Department of Operations
The problem of estimating research manpower requirements is viewed as a flow of funds model. The transitional flow of funds from the operating divisions to the research cost centers is modelled using transfer coefficients that are determined from a statistical analysis of historical data. Transfer coefficients are multiplied by estimated predictions in planned divisional research budgets to yield estimated expenditures in specific research areas. The transfer coefficient model is tested and implementation procedures are presented.
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.