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 211 - 240 of 645
Full-Text Articles in Business Administration, Management, and Operations
The Optimal Selection Of A Portfolio Of Commodity Futures Trading Advisors, Harvey M. Salkin, Peter H. Ritchken
The Optimal Selection Of A Portfolio Of Commodity Futures Trading Advisors, Harvey M. Salkin, Peter H. Ritchken
Research Reports from the Department of Operations
In response to rising inflation, investors are increasingly exploring commodity futures for higher returns. This study examines the dynamics of managed commodity futures accounts, focusing on two investor classes: active portfolio managers and passive investors relying on professional advisors. It identifies the challenges investors face in selecting advisors, highlighting the need for detailed advisor information and comparative analyses. Additionally, it addresses the complexities of constructing optimal portfolios of advisors or investments in open-ended commodity pools to balance risk and reward. The authors conducted a three-month study (ending June 1979) aiming to develop a quantitative investment system for designing portfolios that …
Wrap Line Effectiveness Study, Arnold Reisman, S. Kotha, L. Gonzaga, B. Kidd, T. Murray
Wrap Line Effectiveness Study, Arnold Reisman, S. Kotha, L. Gonzaga, B. Kidd, T. Murray
Research Reports from the Department of Operations
This report details a collaborative effort to enhance the efficiency of order picking and wrapping operations at the George R. Klein News Company. The study, conducted by a task force comprising members from the Klein organization and the Department of Operations Research at Case Western Reserve University, focused on optimizing manpower deployment, line speed, title assignment, and workstation configurations. Data collection involved analyzing company reports, time studies, and consultations with management and staff. Key recommendations include mechanical and computer-aided enhancements to streamline decision-making processes, such as belt space indicators and automated title assignments. Preliminary results suggest significant productivity improvements following …
Applications Of Multi-Attribute Utility Theory In The Health Care Delivery System Since 1970, Durjoy Kumar Chaudhuri, Arnold Reisman
Applications Of Multi-Attribute Utility Theory In The Health Care Delivery System Since 1970, Durjoy Kumar Chaudhuri, Arnold Reisman
Research Reports from the Department of Operations
The Multi-Attribute Utility Theory is a special branch of a more generalized body of theories collectively known as "Decision Theory". Peter Fishburn described it as the "personalistic prescriptive theory of choice for individual decisions". It is personalistic because the decision maker is an indispensable component in almost every phase of research since his personal values and judgements are intimately involved in a decision-making activity. It should be stressed that the multi-attribute utility theory was never meant to be the panacea of any or all decision problems. It helps the decision maker to choose a strategy (or a course of action) …
Final Layout Study Report For Cole Consumer Products, Inc., A. Dale Flowers
Final Layout Study Report For Cole Consumer Products, Inc., A. Dale Flowers
Research Reports from the Department of Operations
The purpose of this report is to summarize the analysis and recommendations of the consulting team for the Cole Consumer Products, Inc. layout study. Most of these results were previously presented to the Layout Study Steering Committee, but are collected here into one document for convenience and future reference. Since much of this information has been previously discussed, we shall limit our explanations to brief ones. The format of our report is to present a brief explanation of the exhibits we prepared for our analyses, followed by the exhibits themselves. As indicated in the Table of Contents, the organization of …
The Role Of Simulation In Health Care Delivery Operations Management Studies, Arnold Reisman, N. G. Duraiswamy
The Role Of Simulation In Health Care Delivery Operations Management Studies, Arnold Reisman, N. G. Duraiswamy
Research Reports from the Department of Operations
Simulation has been used in a number of different roles and in rather disparate health services operations management settings. The paper discusses some of these role/setting combinations to indicate this methodology's depth of usefulness and breadth of applications in a sector approaching 10% of the GNP -- a sector which is under great pressure to contain costs, yet maintain and expand the quality and quantity of services rendered.
The Special Theory Of Coordinate Transformations In Linear Programming, Daniel Solow
The Special Theory Of Coordinate Transformations In Linear Programming, Daniel Solow
Research Reports from the Department of Operations
For a linear program (LP) in which all variables have finite lower and upper bounds, a specific change of coordinates is recommended prior to solving the problem. The transformed problem is obtained by preprocessing the original data, and the result is an equivalent LP for which any state-of-the-art simplex code can be used. A computer simulation substantiates the advantages of this approach. Test results indicate that on a majority of randomly generated problems, significantly fewer iterations are required in the transformed system; for example, in one group of fifty problems, one-third of the total pivots was saved. Even when the …
The General Theory Of Coordinate Transformations In Linear Programming, Daniel Solow
The General Theory Of Coordinate Transformations In Linear Programming, Daniel Solow
Research Reports from the Department of Operations
For any linear program (LP), a specific change of coordinate systems is recommended prior to solving the problem. In the event that all variables have known finite lower and upper bounds, the result of the transformation is an equivalent LP for which any state-of-the-art simplex code can be used. When some (or all) of the variables are unbounded, the origin of the suggested transformed problem may not be a basic feasible solution from which to initiate the usual Phase I procedure. A slightly modified simplex algorithm is proposed to solve the transformed problem.
Gibco/Invenex Physical Distribution Study: Final Project Report, Ronald H. Ballou
Gibco/Invenex Physical Distribution Study: Final Project Report, Ronald H. Ballou
Research Reports from the Department of Operations
company investigated by the author is Omran Company Ltd., an engineering consulting company based in Tehran, Iran. The thesis presents single-level and multi-level mathematical models for use in ZBB and a computer program in ALGOL for solving the mathematical model presented.
Evaluation Of R&D Project Costs, Burton V. Dean, Asim Roy
Evaluation Of R&D Project Costs, Burton V. Dean, Asim Roy
Research Reports from the Department of Operations
This paper presents a general model for cost evaluation in Research and Development and other projects, where it is necessary to predict both the expected cost and its variance. The model shows means of accounting for interdependencies between various cost elements in both the expected value and variance calculation. The model does not require any explicit knowledge of the exact probability distribution of any of the cost elements, but only some approximate values for their expected values, variances and correlations with other variables. If the user of this model is not willing to account for all the interdependencies between various …
An Efficient Cutting Plane Algorithm For Unconstrained Convex Minimization, Daniel Solow
An Efficient Cutting Plane Algorithm For Unconstrained Convex Minimization, Daniel Solow
Research Reports from the Department of Operations
A cutting-plane algorithm is proposed for minimizing a continuously differentiable convex function of n variables. One notable feature of this algorithm is that each cut is actually a supporting hyperplane, which does not require an iterative procedure. To initiate the whole process, a phase I method based on the complementary pivoting algorithms will be used. Of particular interest is the one-dimensional version of the cutting-plane algorithm, which reduces to a new form of line search.
Solving Differentiable Equations Via Constrained Optimization, Daniel Solow
Solving Differentiable Equations Via Constrained Optimization, Daniel Solow
Research Reports from the Department of Operations
The problem of finding a zero of a continuously differentiable system of m equations in n unknowns (m ≤ n) is transformed into a nonlinearly constrained optimization problem for which a Kuhn-Tucker point is shown to be either a solution of the original system or a point at which the derivative matrix is rank deficient. An algorithm is developed for the special case when m equals 1 and the function is convex. It may sometimes be used for finding a minimum of a continuously differentiable convex function, with the advantage of requiring possibly fewer line searches than an ordinary minimization …
Hoeomorphisms Of Triangulations With Applications To Computing Fixed Points, Daniel Solow
Hoeomorphisms Of Triangulations With Applications To Computing Fixed Points, Daniel Solow
Research Reports from the Department of Operations
In the past decade various complementary pivoting algorithms have been developed to search for fixed points of certain functions and point to set maps. All these methods generate a sequence of simplexes which are "shrinking" to a point. This paper proposes a new method for shrinking the simplexes. It is shown that under certain conditions, the function whose fixed point is sought may be used to control this shrinking process. A computational method for implementing these ideas is also suggested and several examples are solved using this approach.
A User's Guide For A Computer System Containing A Search Enumeration Algorithm For The Radio Frequency Intermodulation (Rfi) Problem, Susumu Morito, Harvey M. Salkin, David E. Williams
A User's Guide For A Computer System Containing A Search Enumeration Algorithm For The Radio Frequency Intermodulation (Rfi) Problem, Susumu Morito, Harvey M. Salkin, David E. Williams
Research Reports from the Department of Operations
This manual outlines two search enumeration (or backtrack) algorithms contained in the radio frequency intermodulation (RFI) backtrack code, RFIBCK, and presents user operating instructions and sample computer printouts. Program RFIBCK, written in FORTRAN, can be used to find the lowest order of a given intermodulation product for a fixed set of frequencies. Several randomly generated sample problems, together with their optimal solutions, are also included.
Application Of Management Science Techniques To Dental Practice Management, Arnold Reisman, Susumu Morito, Juan Rivaud, Hamilton Emmons, Edward J. Green
Application Of Management Science Techniques To Dental Practice Management, Arnold Reisman, Susumu Morito, Juan Rivaud, Hamilton Emmons, Edward J. Green
Research Reports from the Department of Operations
This paper describes the structure of a computer-aided dental practice management game and shows how it can be used by dentists to plan their own practices. The game covers a wide spectrum of management decisions in setting up and in running a dental practice. The decisions considered include practice form, location, staffing mix and staff salaries, as well as purchase versus lease options for equipment and/or for space. The game also covers major daily, monthly and yearly decisions including scheduling of patients, workers, and of operatories, forecasting of patient load, and utilization as well as economic analysis. Major design considerations …
A Study Of The Nurse Staffing Needs Of An Intensive Care Unit, N. G. Duraiswamy, R. Welton, Arnold Reisman
A Study Of The Nurse Staffing Needs Of An Intensive Care Unit, N. G. Duraiswamy, R. Welton, Arnold Reisman
Research Reports from the Department of Operations
This paper discusses a study used to establish tradeoffs between the number of full-time registered nurses required to deliver safe nursing care in a 20-bed medical intensive care unit and the percentage of days a given planned staffing level will result in over and under staffing. Retrospective patient load and mix data were collected for a one-year period. These data were curve-fitted for each of four seasons and used in a computer-based simulation to obtain the staffing tradeoff tables.
A Constrained Optimization Algorithm For Solving Certain Convex Systems Of Equations, Daniel Solow
A Constrained Optimization Algorithm For Solving Certain Convex Systems Of Equations, Daniel Solow
Research Reports from the Department of Operations
The purpose of this research is to establish a computationally efficient algorithm for solving certain systems of convex equations. In the past, two basic approaches have been developed. The first approach is based on variations of Newton's method and requires rather stringent conditions on the system of equations whereas the second approach is based on the homotopic or continuation method which requires milder conditions for convergence. The approach in this work will be from an optimization standpoint and convergence will be established under reasonable conditions. In addition, a global algorithm for finding the zero of a convex real valued function …
Cost Effectiveness Of Telemedicine Systems, Burton V. Dean
Cost Effectiveness Of Telemedicine Systems, Burton V. Dean
Research Reports from the Department of Operations
This study developed as a result of a discussion by the Telemedicine Task Force Committee concerning the cost effectiveness of alternative telemedicine systems. The basis of the study is an analysis of the published and unpublished reports on the uses and impacts of telemedicine systems. The survey was considered to be useful in establishing a benchmark for the ongoing Case Western Reserve University Study. The central approach followed in the study is to collect documented reports of telemedicine evaluations studies. The factors affecting cost effectiveness of telemedicine are investigated.
A Study Of The Nurse Staffing Needs Of An Intensive Care Unit, N. G. Duraiswamy, R. Welton, Arnold Reisman
A Study Of The Nurse Staffing Needs Of An Intensive Care Unit, N. G. Duraiswamy, R. Welton, Arnold Reisman
Research Reports from the Department of Operations
This paper discusses a study used to establish tradeoffs between the number of full-time registered nurses required to deliver safe nursing care in a 20-bed medical intensive care unit and the percentage of days a given planned staffing level will result in over and under staffing. Retrospective patient load and mix data were collected for a one-year period. These data were curve-fitted for each of four seasons and used in a computer-based simulation to obtain the staffing tradeoff tables.
Methods In Zero-Base Budgeting, Burton V. Dean
Methods In Zero-Base Budgeting, Burton V. Dean
Research Reports from the Department of Operations
This paper provides the background, elements, and needs in Zero-Base Budgeting. A brief review of the historical development of Zero-Base Budgeting in this decade and a description of how ZBB evolved from other budgeting systems are presented. The basic elements of the ZBB process and the types of information required are prescribed. The needs in ZBB are presented, based on organizational use of this process. Methods for incorporating resource allocation and ranking techniques are indicated. With the increasing use of ZBB in organizations, both in public and private sectors, there will be an opportunity to introduce such methods into the …
Using Integer Programming To Detect The Significant Sources Of Radio Frequency Intermodulation Interference, Susumu Morito, Harvey M. Salkin
Using Integer Programming To Detect The Significant Sources Of Radio Frequency Intermodulation Interference, Susumu Morito, Harvey M. Salkin
Research Reports from the Department of Operations
The radio frequency communication environment in naval vessels, aircraft, space vehicles, and satellites has become increasingly complex as more transmitters and receivers are added to perform multiple functions. Various types of interference in the electromagnetic spectrum pose a serious threat to accurate and reliable communication systems. An interesting and important type of interference is intermodulation, which is amenable to mathematical study. After presenting the technological background and an important application in naval fleet scenarios, a heuristic algorithm for the resulting model—an integer program with a single constraint and unrestricted variables—is presented. The solution to the model may be used to …
An Index Of Accessibility For Ambulatory Health Services, Howard Simon, Arnold Reisman, Shahriar Javad, Diane Lurie Sachs
An Index Of Accessibility For Ambulatory Health Services, Howard Simon, Arnold Reisman, Shahriar Javad, Diane Lurie Sachs
Research Reports from the Department of Operations
This paper discusses an Index developed and used to measure accessibility to health services provided on an outpatient basis at the Kaiser Community Health Foundation, Cleveland, Ohio. The Index is based on four levels of urgency or severity of illness and on the waiting times to get entry into the system. The parameters of the Index, initially established by task force members, were tested on a sample basis against the judgments of Kaiser outpatient facility users and finally refined through the consensus-seeking Delphi technique using a panel representing Kaiser members, gatekeepers, physicians and administrators. The actual time required to gain …
On Forbidden Theta Subgraphs Of Non-Hamiltonian 2-Connected Graphs, Daniel Solow
On Forbidden Theta Subgraphs Of Non-Hamiltonian 2-Connected Graphs, Daniel Solow
Research Reports from the Department of Operations
A new proof technique for showing certain graphs are Hamiltonian is presented. One assumes G to be non-Hamiltonian and derives a contradiction by showing that a largest cycle of G can be strictly increased in length. The results are that if certain theta subgraphs do not appear in G then G is Hamiltonian.
A Survey Of The Applications Of Quantitative Techniquest In Radio Communication Interference Problems, Susumu Morito, Harvey M. Salkin
A Survey Of The Applications Of Quantitative Techniquest In Radio Communication Interference Problems, Susumu Morito, Harvey M. Salkin
Research Reports from the Department of Operations
This study explores the application of quantitative techniques to address radio and radar interference in congested electromagnetic environments. The models analyze factors such as transmitter spurious emissions, receiver spurious responses, intermodulation between transmitters and receivers, adjacent and cochannel interference, cross-modulation interference, receiver desensitization, and saturation. Key controllable variables include transmitter and receiver frequencies, transmitter power, and equipment location. The primary objective is to minimize unwanted interference in these systems. To achieve this, the study employs advanced problem-solving methods, including linear programming, integer programming, dynamic programming, and heuristics. This work provides a systematic framework for managing interference in complex electromagnetic networks, …
On Hamiltonian Graphs And Perfect Matchings, Daniel Solow
On Hamiltonian Graphs And Perfect Matchings, Daniel Solow
Research Reports from the Department of Operations
The main theorem gives necessary and sufficient conditions for graphs having an even number of vertices to be Hamiltonian in terms of its perfect matchings. This result can be used to determine that certain graphs are not Hamiltonian because they do not contain a perfect matching. A sufficient condition for a graph on an odd number of vertices to be Hamiltonian is also presented.
A Survey Of Static Job Shop Scheduling Theory, Hamilton Emmons
A Survey Of Static Job Shop Scheduling Theory, Hamilton Emmons
Research Reports from the Department of Operations
This paper explores the current theoretical understanding of static job shop scheduling, focusing on assigning tasks to processors while optimizing objectives such as timing and sequence. Tasks, characterized by parameters like processing time and due dates, may form dependent groups (jobs) or remain independent. The study distinguishes job shop scheduling from broader scheduling fields such as production and manpower scheduling. Combinatorial challenges in this domain have been extensively studied, with optimal scheduling rules available for simpler cases, while complex problems often rely on computationally intensive algorithms. The paper outlines efficient algorithms with polynomial time complexity and highlights insights from complexity …
Paying Unemployment Compensation Taxes And Solving The Complete Set Partitioning Problem, Chien-Hua Lin, Harvey M. Salkin
Paying Unemployment Compensation Taxes And Solving The Complete Set Partitioning Problem, Chien-Hua Lin, Harvey M. Salkin
Research Reports from the Department of Operations
It is shown that under certain regulations specified by state law, there is an optimal way for a corporation to pay unemployment compensation taxes. The particular scenario is given along with the natural model which turns out to be a set partitioning problem having all possible nonzero binary columns in the constraint matrix. A highly specialized enumerative algorithm, which never requires the explicit maintenance of the model, is also presented. Computational results and their impact, reflecting recent data from several Ohio based corporations, are listed.
A Natural Gas Purchasing And Storage Model Under Uncertainty In Demand, Reuven R. Levary, Burton V. Dean
A Natural Gas Purchasing And Storage Model Under Uncertainty In Demand, Reuven R. Levary, Burton V. Dean
Research Reports from the Department of Operations
Storage and purchasing policies that minimize expected shortages of natural gas in the service area supplied by a single natural gas utility are developed. The problem is formulated and solved using a multi-period linear programming model. The model takes into consideration the variability of weather conditions and its effect on the demand for natural gas. Forecasts of future weather conditions are updated several times during the model planning periods; also, the optimal flows of natural gas are determined at the time that the forecasts are updated. The optimal storage quantities at the beginning of each time period and the consequences …
Final Report To Develop And Apply Management Techniques For Use In The Improvement Of The University Research Administration Function, Burton V. Dean
Final Report To Develop And Apply Management Techniques For Use In The Improvement Of The University Research Administration Function, Burton V. Dean
Research Reports from the Department of Operations
The major objectives of this study were (1) to design and implement an improved system for use in research administration at Case Western Reserve University (CWRU), and (2) to organize and to disseminate to other universities those concepts and solutions found useful by CWRU. The project was performed in four phases: (1) a detailed description of the total research administration system at CWRU, (2) detailed problem analyses, (3) development of a proposal for implementation, and (4) implementation and evaluation of the results of the study. In Phase I, a systems description of the research administration process was performed. Methods and …
Finding The General Solution Of A Linear Diophantine Equation, Susumu Morito, Harvey M. Salkin
Finding The General Solution Of A Linear Diophantine Equation, Susumu Morito, Harvey M. Salkin
Research Reports from the Department of Operations
A new procedure for finding the general solution of a linear diophantine equation is given. As a byproduct, the algorithm finds the greatest common divisor (gcd) of a set of integers. Related results and discussion concerning existing procedures, are also given.
Dental Management Game Administrator's Manual, Arnold Reisman, Hamilton Emmons, Susumu Morito, Juan Rivaud, Edward J. Green
Dental Management Game Administrator's Manual, Arnold Reisman, Hamilton Emmons, Susumu Morito, Juan Rivaud, Edward J. Green
Research Reports from the Department of Operations
This paper discusses progress on the development of a computer aided game to teach various management skills to dental students as well as to dental practitioners. The game first deals with the decisions concerning the establishment of a practice, e. g., preferences regarding location, the form (solo, associate or group) of practice, staff patterns and salaries, purchasing of facilities, etc. Next considered are decisions which must be made daily, e. g., patient and worker scheduling, control of supplies, etc. Performance is evaluated in terms of income, costs, care delivered, patient waiting time and personnel utilization.