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 481 - 510 of 645
Full-Text Articles in Business Administration, Management, and Operations
Comparison Of Replacement Strategies, Arvind Jain, K.P. K. Nair
Comparison Of Replacement Strategies, Arvind Jain, K.P. K. Nair
Research Reports from the Department of Operations
In this paper, replacement strategies applicable to failing type items with monotonically increasing failure rate are considered. In particular, multistage as well as single stage strategies are compared with respect to the Behaviour of their important characteristics. Considerations in the choice and implementation of the strategies are discussed besides outlining a few typical applications.
The Delphi Method, Substance, Context, A Critique And An Annotated Bibliography, Juri Pill
The Delphi Method, Substance, Context, A Critique And An Annotated Bibliography, Juri Pill
Research Reports from the Department of Operations
This paper is concerned with a methodology for efficiently obtaining consensus from a panel of evaluators on questions that are shrouded in uncertainty and cannot be measured or evaluated in the classical sense. The methodology and its historical development are described, it is placed in context vis-à-vis other methods of subjective scaling, and a critique is provided. An extensive and current annotated bibliography is presented.
An Annotated Bibliography: Job-Shop Scheduling, Nandakumar M. Balwally
An Annotated Bibliography: Job-Shop Scheduling, Nandakumar M. Balwally
Research Reports from the Department of Operations
This document provides a brief survey on job-shop scheduling and related annotated bibliography.
An Application Of The Matrix Method In Physiological Psychology Research Planning, Burton V. Dean, Samuel Jackson Mathis, Harvey M. Salkin, R. Chandrasekaran
An Application Of The Matrix Method In Physiological Psychology Research Planning, Burton V. Dean, Samuel Jackson Mathis, Harvey M. Salkin, R. Chandrasekaran
Research Reports from the Department of Operations
This report describes a series of experiments concerning an application of the Matrix Method of evaluating research tasks. An initial model is concerned with zero-one relationships, while the final model is concerned with weighted alternatives. Contributions from each task towards a set of objectives is determined. Applications of integer programming to allocation models is also discussed.
A General Model For Investment Decisions; A Stochastic Extension, Arnold Reisman, Arza K. Rao
A General Model For Investment Decisions; A Stochastic Extension, Arnold Reisman, Arza K. Rao
Research Reports from the Department of Operations
In the general situation in which investments and/or equipment replacements have to be made at several points of time, Reisman and Buffa have developed a model which will reduce to their present worth all disbursements and receipts involved in the possession and operation of a succession of equipments. This paper deals with a stochastic variation of the above model. General expressions are derived for the expected values of the Purchase Prices, Salvage Values, Operating Expenses and Revenues. The model assumes that the lives of equipment are also stochastic in nature. The case when the rate of return is a function …
A Preliminary Systems And Allocation Study Of The Cleveland Police Department, Burton V. Dean, Arnold Reisman, Andrew Frank Daughety, Ronald Ehresman, Vaughn E. Huckfeldt, Marylou Kiley, Coskun Pekmezciler
A Preliminary Systems And Allocation Study Of The Cleveland Police Department, Burton V. Dean, Arnold Reisman, Andrew Frank Daughety, Ronald Ehresman, Vaughn E. Huckfeldt, Marylou Kiley, Coskun Pekmezciler
Research Reports from the Department of Operations
This study develops a systems description of the information flows in the Cleveland Police Department relating to the Bureau of Operations. A suitable response and assignment queue is defined as a sequence involving the citizen waiting time from the observation of an incident to communication with police headquarters, a police dispatch queue, and a patrol assignment and report queue. A mathematical model for the allocation of patrol resources is developed so as to minimize an objective function based on patrol- response time and the values of different police services to the community. Recommendations for testing and implementation of the model …
Reliability Of A Repairable System With Spares Deterioration In Storage, R. Natarajan, S. Subba Rao
Reliability Of A Repairable System With Spares Deterioration In Storage, R. Natarajan, S. Subba Rao
Research Reports from the Department of Operations
Reliability characteristics such as long-run availability and the time to system failure (TSF) of a system consisting of a single unit in use backed by (N-1) spares and C repair facilities have been obtained when failures of the unit in use as well as spares in storage occur with constant failure rates λ1 and λ2, respectively, and the repair time of these units follows an exponential distribution with parameter μ. The long-run availability has been derived using known results of birth and death processes. Making use of the property that the TSF period followed by a system down (SDT) period …
Comparison Of Replacement Strategies For Items That Fail, Arvind Jain, K.P. K. Nair
Comparison Of Replacement Strategies For Items That Fail, Arvind Jain, K.P. K. Nair
Research Reports from the Department of Operations
In this paper, replacement strategies applicable to failing type of items with monotonically increasing failure rate are considered. In particular, multistage as well as single stage strategies are compared with respect to the behaviour of their important characteristics. Considerations in the choice and implementation of the strategies are discussed.
Capital Budgeting/Project Selection By Mathematical Programming: An Annotated Bibliography, Roy B. Larson
Capital Budgeting/Project Selection By Mathematical Programming: An Annotated Bibliography, Roy B. Larson
Research Reports from the Department of Operations
This document is an outgrowth of research undertaken as part of the author's Doctoral studies in the Organizational Sciences. A portion of the work was completed in partial fulfillment of requirements for a readings course in Operations Research, taken in the spring semester, 1969, under Dr. Yoshiro Kuratani. The motivation behind both the course work and the subsequent effort was purely personal: the comprehensive survey of literature relevant to the application of mathematical programming methods in corporate planning, anticipating the preparation of a dissertation in this subject area.
On Electrical Analogy Of Critical Path Method, K. Shankar, K.P. K. Nair
On Electrical Analogy Of Critical Path Method, K. Shankar, K.P. K. Nair
Research Reports from the Department of Operations
Critical path method of project planning, scheduling and control has gained considerable importance because of its theoretical novelty and practical value. Essentially, this technique is based on the theory of flow through network. Although the structure of a project network holds analogy with electrical net, the branch characteristics fail to have the analogy. Battersby has solved this problem by introducing two kinds of floats, namely, duration and resource floats in the network. In this paper, complete electrical analogy is established following a somewhat different approach. With this approach current is injected or released at the appropriate nodes. The resulting G, …
A Process With Chain Dependent Growth Rate - Part Ii The Ruin And Ergodic Problems, Julian Keilson, S. Subba Rao
A Process With Chain Dependent Growth Rate - Part Ii The Ruin And Ergodic Problems, Julian Keilson, S. Subba Rao
Research Reports from the Department of Operations
In [5] the homogeneous process X(t) defined on a finite irreducible Markov chain P(t) was studied. The process was characterized by an overall transition rate v per unit time, and P the matrix of transition probabilities for the chain and a linear growth for X(t) dependent on the chain; viz. d/dt X(t) = v•. The central limit behavior of the process was exhibited in [5]. For the case when the chain had only two states, the ruin and ergodic problems were considered in [4] for the bounded process. The object of this paper is to investigate the ruin and ergodic …
Some Stochastic Systems With Secondary Inputs, Izzet Sahin
Some Stochastic Systems With Secondary Inputs, Izzet Sahin
Research Reports from the Department of Operations
This study investigates the limiting behavior of stochastic processes in systems with two types of inputs of differing statistical nature and linear continuous output. Type 1 input points are modeled as a time-homogeneous Poisson process, while Type 2 input points follow a recurrent process, both with magnitudes that are mutually independent, identically distributed, positive random variables. Conditions for the existence of limiting distributions are established, yielding practical results for queueing theory, storage theory, and insurance risk theory. Using a vector-Markov process, the problem is reduced to solving an integral equation via Wiener-Hopf factorization. Closed-form results for Laplace transforms of limiting …
Reliability With Standbys, S. Subba Rao, R. Natarajan
Reliability With Standbys, S. Subba Rao, R. Natarajan
Research Reports from the Department of Operations
The reliability of complex systems is improved by providing redundancy in the design of the systems. When a component fails, it is replaced immediately from a standby, and the failed component is either repaired and put back into operation or discarded. The reliability characteristics of the system depend on the nature of the standby--hot, cold, or warm--and the availability or lack of repair facilities. This paper attempts to review the work done in the area of reliability of standby systems.
A Preliminary Report On The Economic Impact Of Research And Development Budget Decrements, Burton V. Dean, Arnold Reisman, Richard Kominowski, Arun Sanghvi
A Preliminary Report On The Economic Impact Of Research And Development Budget Decrements, Burton V. Dean, Arnold Reisman, Richard Kominowski, Arun Sanghvi
Research Reports from the Department of Operations
The purpose of this study is to determine the effects of a decrement in the level of financing of R&D projects by the federal government upon research organizations and upon the local regional economy. Specifically, we have developed a computer simulation model to investigate the dynamic effects of budget documents on the research organization and the economy in which it is located. A flow chart about to be incorporated in a computer program is presented.
Stock Market Responses To Risks Associated With Various Levels Of Financial Leverages, Yoshiro Kuratani, Joseph E. Bechtold, Samuel J. Mantel Jr.
Stock Market Responses To Risks Associated With Various Levels Of Financial Leverages, Yoshiro Kuratani, Joseph E. Bechtold, Samuel J. Mantel Jr.
Research Reports from the Department of Operations
This study examines the relationship between a company’s capital structure, specifically its debt-equity ratio, and the market value of its common stock. The hypothesis asserts that the market value follows an inverse U-shaped function of the debt-equity ratio. A cross-sectional stock valuation model provides empirical evidence supporting this claim. Theoretical arguments include: (a) Companies with no or low debt fail to capitalize on the benefits of low-cost debt, resulting in lower stock valuations; and (b) excessive debt increases financial risk and embedded interest costs, amplifying total risk and deterring investors, which in turn depresses stock value. The findings highlight the …
Experiments On Scheduling Disciplines In Surgery: A Simulated Queueing Approach, Augustine O. Esogbue
Experiments On Scheduling Disciplines In Surgery: A Simulated Queueing Approach, Augustine O. Esogbue
Research Reports from the Department of Operations
Research in hospital systems suggests the grouping of the various rules for allocating facilities to requests in surgery into five major categories called scheduling disciplines. This paper reports an effort to analyze and compare the efficiencies of these policies using queueing theory and computer simulation. Results obtained from actual studies of two major hospitals are provided in the form of graphs and figures. Given a facility with N operating rooms and depending on management's objectives, an optimal scheduling doctrine can be devised using these graphs. These graphs can also aid in the optimal planning and design of hospital facilities.
Evaluation And Budgeting Model For A System Of Social Agencies, Arnold Reisman, Samuel J. Mantel Jr., Burton V. Dean, Norman C. Eisenberg, Allan L. Service
Evaluation And Budgeting Model For A System Of Social Agencies, Arnold Reisman, Samuel J. Mantel Jr., Burton V. Dean, Norman C. Eisenberg, Allan L. Service
Research Reports from the Department of Operations
An application of Operations Research methods to the planning and budgeting problems of a federation of 21 voluntary, private, social agencies is described. The agencies involved include a major community hospital, several old age homes, several educational institutions ranging all the way from primary grades to higher education, and individual, family, and vocational counselling agencies. The goals of the system are identified and a basic structural unit, the client-service-agency package is developed. A measure of package output is formulated, incorporating elements that deal with physical throughput, quality, and value of service. This measure of output can be used to generate …
A History Of Industrial Research In The United States, Michael Massouh
A History Of Industrial Research In The United States, Michael Massouh
Research Reports from the Department of Operations
Today, the products of industrial research are visible everywhere. Moreover, the activity of industrial research is viewed as basic to a company's and indeed a country's continuing economic development. Industrial research has become such an important enterprize that it has itself become the subject of extensive studies for which Project Themis is a recent example. Moreover, the impact of all research is so profound that in many quarters it is taken for granted. Yet, this situation was not always the case. Historically, industrial research as practiced today is a relatively modern development having taken place within the last century. It …
A Special Case Of The Complementary Pivot Problem, R. Chandrasekaran
A Special Case Of The Complementary Pivot Problem, R. Chandrasekaran
Research Reports from the Department of Operations
This paper addresses a fundamental problem in linear programming, quadratic programming, and bimatrix games: solving a system involving vectors w and z, subject to complementarity and non-negativity constraints. Existing algorithms solve this problem when the matrix M meets specific properties such as being positive semi-definite, copositive-plus, or adequate. The paper extends the problem to a broader class of matrices, including L-matrices, which are not necessarily copositive-plus, adequate, or positive semi-definite. An efficient algorithm is introduced to solve the problem for this generalized class, and its steps and correctness are detailed.
The M/G/1 Queue With Semi-Markov Service Times, N.K. Jaiswal, S. Subba Rao
The M/G/1 Queue With Semi-Markov Service Times, N.K. Jaiswal, S. Subba Rao
Research Reports from the Department of Operations
The queuing process M|G|1 is studied under the assumption that the successive service times form a M-state semi-Markov Process. This model has been studied earlier by Nuets (1966). The present approach to the problem is, however, different and will be helpful in studying a large number of ramifications of this basic model.
Mathematical Programming, Computers And Large Scale Water Resource Systems, Augustine O. Esogbue
Mathematical Programming, Computers And Large Scale Water Resource Systems, Augustine O. Esogbue
Research Reports from the Department of Operations
This article discusses the complexity of water resource systems and the interdisciplinary nature of addressing their associated challenges. It emphasizes the subjective nature of defining such systems, as perspectives differ across disciplines (engineering, economics, law, etc.) and geographical contexts (humid versus arid regions). Large-scale water resource problems, particularly multi-purpose regional systems, are characterized by their complexity, often requiring advanced analytical tools from systems engineering and operations research for optimal solutions. Key approaches to solving these large-scale problems include approximation, abstraction, and hierarchical or multilevel methods, each with distinct techniques for simplifying and coordinating system components. These methodologies help address complex …
A Research Bibliography On "Two-Stage" Probabilistic Programming 1964-1969, Robert E. Fricks
A Research Bibliography On "Two-Stage" Probabilistic Programming 1964-1969, Robert E. Fricks
Research Reports from the Department of Operations
This presentation is an outgrowth of an earlier report "Probabilistic Programming 1950-1963: An Annotated Bibliography" which has appeared as Technical Memorandum No. 155 of the Department of Operations Research, School of Management, Case Western Reserve University. The organization, format, and rationale for this document is drawn from that of the former which should be consulted as to the structural details of this summary. It is noted in passing that an attempt has been made to provide the most complete and up-to-date reference citations possible. Where only partial information as to the literature citation is presented in the entry provided, it …
Enumerative Algorithms For Integer And Mixed Integer Programs, Harvey M. Salkin
Enumerative Algorithms For Integer And Mixed Integer Programs, Harvey M. Salkin
Research Reports from the Department of Operations
This thesis presents two flexible zero-one integer programming (single branch enumerative) algorithms. It is shown that the first method, applicable to the general program (i.e., min.(c'y: Ay<=b, y_j=0 or 1) ), has the ability, via a new dynamic origin technique, to adapt to the problem data. Other pioneering features, which assist in curtailing the length of the search, are linear programming, post optimization, and criteria for selecting branches from feasible nodes. Using this approach as a foundation, an extension for the mixed integer program (i.e., min.(c'y+d'x: Ay+Dx<=b, x>=0, y_j=0 or 1) ) is discussed. The second algorithm, applicable to the set covering problem (i.e., min.(c'y: Ry>=e, y>=0, y integer); where R is a matrix of 0's and 1's, and e is a vector of 1's), basically obtains upper and lower bounds on the integer problem from the associated linear program. It is shown, by certain proved facts, that one can always obtain two (and sometimes three) integer feasible …=b,>
Efficient Methods For Unconstrained Minimization, Leon S. Lasdon
Efficient Methods For Unconstrained Minimization, Leon S. Lasdon
Research Reports from the Department of Operations
It is now well known that the most efficient methods for unconstrained minimization which do not require second derivatives are those which, when applied to a quadratic, generate conjugate directions [1-4]. This insures that a quadratic in n variables is minimized in n steps or less. Since a general twice differentiable function behaves like a positive semidefinite quadratic in the neighborhood of its minimum, methods which will minimize it efficiently must work well on a quadratic. Conjugate direction methods meet this requirement, do not require second derivatives, and can be constructed so that the function is reduced at each step. …
On Determining Significant Factors For Use In Evaluating R & D Projects, Chandrasekhar Das
On Determining Significant Factors For Use In Evaluating R & D Projects, Chandrasekhar Das
Research Reports from the Department of Operations
This report is concerned with selection of factors for the purpose of evaluating Research and Development projects. The approach is statistical. Projects are selected from different Divisions of the Army Materiel Command and ranked according to each of a number of proposed factors. The relative importance of the projects selected from the same Division are known a priori. Correlation coefficients between the a priori and each observed rank-order series are obtained. It is supposed that between two factors, the one having a larger number of significant correlation coefficients is more relevant than the other as a basis for project selection.
A Matrix Approach To R&D Budget Allocation Problems, Samuel Jackson Mathis, Peter Herne, Burton V. Dean
A Matrix Approach To R&D Budget Allocation Problems, Samuel Jackson Mathis, Peter Herne, Burton V. Dean
Research Reports from the Department of Operations
This paper involves an examination of an approach towards the problem of funds allocation in a research environment. The approach uses matrices of projects-sciences and sciences-objectives for which entries are subjectively estimated and compared with weighted objectives. Two examples, using hand calculations and generated data, are given. Conclusions drawn from these examples and possibilities of further applications are discussed.
Probabilistic Programming 1950-1963: An Annotated Bibliography, Robert E. Fricks
Probabilistic Programming 1950-1963: An Annotated Bibliography, Robert E. Fricks
Research Reports from the Department of Operations
This document has been prepared as a part of the author's Doctoral research program in Operations Research at Case Western Reserve University. The motivation for the effort has been purely selfish. Since a comprehensive literature survey in the proposed area of study is a desirable prerequisite to the formulation of a meaningful thesis problem the readings would have been appropriate in any event. Given the volume of writings in the field of interest it is logical that some sort of systematic index be prepared to aid in the retention of the techniques presented by the accumulated literature. This bibliography with …
Applications Of Binary Programming To R&D Project Selection Problems, Arza K. Rao
Applications Of Binary Programming To R&D Project Selection Problems, Arza K. Rao
Research Reports from the Department of Operations
This paper utilizes binary programming formulations of certain R&D project selection problems. This formulation leads to significant computational advantages over the previous formulations. The first problem considered is that of allocating a specified budget among a set of technical approaches, so that the probability of at least one approach being successfully completed is maximized. Secondly, the problem of multi-period allocation is considered, where the objective function is the same as above. Thirdly, a shared project model is also considered, where each project can be allocated different amounts. An algorithm to solve binary programming problems has been developed by Professor Egon …
Computer Time-Saving Applications In Economic Analysis: An Integrated Approach, Martin I. Taft, Arnold Reisman
Computer Time-Saving Applications In Economic Analysis: An Integrated Approach, Martin I. Taft, Arnold Reisman
Research Reports from the Department of Operations
A generalized evaluation program known as EVAL, and a general "present worth" program known as CEBS have been developed in the FORTRAN IV Computer language and are currently operational on a time-sharing or batch basis. The programs lead an individual or a group of people through a systematic step-by-step procedure for evaluating the relative value (utility including present worth) of each of a given set of alternatives with respect to explicitly stated goals and objectives. Applications in such areas as equipment design, selection, optimization and replacement; personnel administration; and allocation of resources are presented.
Analysis Of Usage Of The University Circle Development Foundation Bus System, William J. Brown, James K. Hartman
Analysis Of Usage Of The University Circle Development Foundation Bus System, William J. Brown, James K. Hartman
Research Reports from the Department of Operations
An equitable method of allocating the costs of operating the UCDF shuttle bus system across member institutions is one according to which member institutions would be assessed a fraction of the system's costs equal to the ratio of its riders to total ridership. In order to develop such a method, that is to obtain the individual institution ratios, a passenger survey was conducted by non-UCDF personnel. From this survey, institution ratios were computed for ten institutions judged to be the heaviest users of the system. These ratios, separately calculated for each bus route and weekday, weekend, and whole week service, …