Open Access. Powered by Scholars. Published by Universities.®

Business Administration, Management, and Operations Commons™

Open Access. Powered by Scholars. Published by Universities.®

Case Western Reserve University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 871 - 900 of 1196

Full-Text Articles in Business Administration, Management, and Operations

Pops A Program Oriented Planning System For Academic Health Centers, Kenneth Lee Kutina Jan 1974

Pops A Program Oriented Planning System For Academic Health Centers, Kenneth Lee Kutina

Research Reports from the Department of Operations

In recent years, because of the enormous financial pressure under which most universities have found themselves coupled with almost climactic national pressure from the public and politicians alike to increase the supply of physicians, much attention has been focused on the costs and managerial capabilities of the nation's academic health centers. In the cost arena the concern has been the determination of meaningful program costs -- that is, separation to the extent possible of costs associated with the major output programs of research, patient service, and education and within the education area, the separation of the costs of producing M.D.'s …

Go to article

Anesthesiology Manpower Planning Study Phase Iii - Final Report, Arnold Reisman, F. J. Staub, Hamilton Emmons, Burton V. Dean, Cornelis A. De Kluyver, M. Lin, Thomas George, John J. Rasmussen, Phiroz P. Darukhanavala, J. S. Gravenstein Jan 1974

Anesthesiology Manpower Planning Study Phase Iii - Final Report, Arnold Reisman, F. J. Staub, Hamilton Emmons, Burton V. Dean, Cornelis A. De Kluyver, M. Lin, Thomas George, John J. Rasmussen, Phiroz P. Darukhanavala, J. S. Gravenstein

Research Reports from the Department of Operations

This document outlines the progress and proposed work in a project focused on anesthesia services in Cuyahoga County, Ohio. It includes projections of the demand for anesthesia services and the supply of anesthesiologists up to 1980, using various models such as demand extrapolation, regression models, and expert opinions. The chapter details the classification of anesthesia-related tasks and personnel, the development of a patient condition scale for surgical risk assessment, and the design of optimal anesthesia teams. It also discusses the economic analysis of team configurations, computer simulations of operating room practices, and the use of telemedicine for remote anesthesiologist consultations.

Go to article

A Preliminary Total Cost Model For Primary Journals, Burton V. Dean Jan 1974

A Preliminary Total Cost Model For Primary Journals, Burton V. Dean

Research Reports from the Department of Operations

This study is concerned with indentifying the principal cost components associated with the production, documentation, and utilization of U.S. Scientific journals. The approach developed in this study is based upon a systems description of the scientific journal as a flow of information from the initial generation of useful knowledge to the preparation of reports and papers, submission to and processing by journals, including production and distribution, and ultimate use by libraries and individuals. Costs of each system component are identified to the extent available in the published literature and within the time and effort available for this study. The study …

Go to article

Analysis Of Feedback Models Of Higher Education Degree Production, Alfred R. Michenzi Jan 1974

Analysis Of Feedback Models Of Higher Education Degree Production, Alfred R. Michenzi

Research Reports from the Department of Operations

This paper is concerned with the development of optimal solutions to manpower planning problems. The dynamic flow model of the higher educational system as proposed by Reisman and Taft was modified for more tractable computer simulation. The model considered, treats people as the only flow variable. The model follows the flow of people from one educational level to the next and within one level it follows the flow from one sector to the next, (the three sectors considered are students, professionals and faculty sectors). Real population data for the period 1957 through 1968 was used in the simulation. The results …

Go to article

Simulation Of Obstetrical Anesthesia Team Configurations Managerial Report, Arnold Reisman, W. Cull, Hamilton Emmons, Burton V. Dean, C. Lin, John J. Rasmussen, Phiroz P. Darukhanavala, Thomas George, J. S. Gravenstein Dec 1973

Simulation Of Obstetrical Anesthesia Team Configurations Managerial Report, Arnold Reisman, W. Cull, Hamilton Emmons, Burton V. Dean, C. Lin, John J. Rasmussen, Phiroz P. Darukhanavala, Thomas George, J. S. Gravenstein

Research Reports from the Department of Operations

A research group, comprised of faculty and graduate students from the School of Medicine and from the Department of Operations Research of Case Western Reserve University, investigated ways to alleviate the shortage of anesthesiologists in obstetric practices. The nationwide problem is acknowledged by, and the project was sponsored by the Maternal and Child Health Division of the U.S. Department of Health, Education, and Welfare. The three project stages were: survey and detailed analysis of the existing situation in one region of the United States, the construction and validation of a computer simulation model to study alternative practice modes with speed, …

Go to article

Survey Of Obstetrical Anesthesiology Practices And Attitudes In Hospitals In Cuyahoga County, Ohio, Arnold Reisman, John J. Rasmussen, W. Cull, Hamilton Emmons, Burton V. Dean, Phiroz P. Darukhanavala, Thomas George, Chien-Hua Lin, J. S. Gravenstein Dec 1973

Survey Of Obstetrical Anesthesiology Practices And Attitudes In Hospitals In Cuyahoga County, Ohio, Arnold Reisman, John J. Rasmussen, W. Cull, Hamilton Emmons, Burton V. Dean, Phiroz P. Darukhanavala, Thomas George, Chien-Hua Lin, J. S. Gravenstein

Research Reports from the Department of Operations

This report presents findings from surveys conducted by the Obstetrical Anesthesia Manpower Planning study, Case Western Reserve University, and the Cleveland Committee on Anesthesiology. The study focused on obstetric anesthesia practices in Cuyahoga County, Ohio, exploring current practices, administrative perceptions of anesthesiologists' assistants, and attitudes of anesthesiologists, obstetricians, and nurse anesthetists regarding their roles in obstetrics. Questionnaires were sent to hospital administrators and anesthesiology department directors at 20 hospitals, gathering insights into professional employability and involvement. Due to a small sample size, nurse anesthetist data was excluded. Responses are analyzed by audience group across four chapters, with a final chapter …

Go to article

Simulation Of Obstetrical Anesthesia Team Configurations, Arnold Reisman, W. Cull, Hamilton Emmons, Burton V. Dean, C. Lin, John J. Rasmussen, Phiroz P. Darukhanavala, Thomas George, J. S. Gravenstein Dec 1973

Simulation Of Obstetrical Anesthesia Team Configurations, Arnold Reisman, W. Cull, Hamilton Emmons, Burton V. Dean, C. Lin, John J. Rasmussen, Phiroz P. Darukhanavala, Thomas George, J. S. Gravenstein

Research Reports from the Department of Operations

A research group, comprised of faculty and graduate students from the School of Medicine and from the Department of Operations Research of Case Western Reserve University, investigated ways to alleviate the shortage of anesthesiologists in obstetric practices. The nationwide problem is acknowledged by, and the project was sponsored by the Maternal and Child Health Division of the U.S. Department of Health, Education, and Welfare. The three project stages were: survey and detailed analysis of the existing situation in one region of the United States, the construction and validation of a computer simulation model to study alternative practice modes with speed, …

Go to article

University Parking Demand Study, Michael Baum, Don Begley, Joel Brandon, Burton V. Dean, Clara Gulyas, Keith Kundo, Harsh Manglik, S. Subba Rao, Phyllus Selders, Ram Shankaran, Laura Washington Nov 1973

University Parking Demand Study, Michael Baum, Don Begley, Joel Brandon, Burton V. Dean, Clara Gulyas, Keith Kundo, Harsh Manglik, S. Subba Rao, Phyllus Selders, Ram Shankaran, Laura Washington

Research Reports from the Department of Operations

This report analyzes parking permit and visitor parking demand to assess their impact on future parking facility plans at the University. Using statistical methods to identify trends and the DELPHI Method to estimate future demand, the study also incorporates questionnaire data to determine visitor destinations and compares Case Western Reserve University's parking availability and fees to peer institutions. Recommendations are provided regarding the need for new parking facilities and potential improvements to parking services for the University community

Go to article

Optimal Design Of Acoustic Sonar Transducer Arrays, Leon S. Lasdon, Allan D. Waren, Dan Suchman Nov 1973

Optimal Design Of Acoustic Sonar Transducer Arrays, Leon S. Lasdon, Allan D. Waren, Dan Suchman

Research Reports from the Department of Operations

A problem in engineering design is formulated and solved as a nonlinear optimization problem. The problem is to design an array of sonar acoustic transducers. Design parameters are the locations of the transducers, and their amplitude shading coefficients and phase delays. The objective is to choose values for these parameters so that the directivity pattern of the array has a narrow main lobe and minimal minor lobe levels. The problem is solved by an interior penalty function method. Results are presented which show significant improvement of the directivity pattern for 2 test problems. A final section discusses the effects varying …

Go to article

Cost Effectiveness Study Of Two Experimental Programs At A Major Public Hospital, Burton V. Dean, Arnold Reisman, Phiroz P. Darukhanavala, C. Egyhazy Nov 1973

Cost Effectiveness Study Of Two Experimental Programs At A Major Public Hospital, Burton V. Dean, Arnold Reisman, Phiroz P. Darukhanavala, C. Egyhazy

Research Reports from the Department of Operations

This report presents a Cost-Effectiveness Evaluation Study performed at a Major Public Hospital in the Cleveland Area. The purpose of this study was to evaluate two experimental programs instituted in 1973. The cost-effectiveness evaluation model is developed and applied to the two experimental programs - Clinic '68' and Admission. Prior to the development of the model a complete systems description was prepared. The model contains cost and effectiveness factors, which are evaluated individually and combined, according to their relative importance, into a single cost-effectiveness value. This methodology has the characteristic of being transferable to other health care program evaluations. Methods …

Go to article

Predicting Registered Nurse Labor Turnover, Marylou Kiley, S. Subba Rao Oct 1973

Predicting Registered Nurse Labor Turnover, Marylou Kiley, S. Subba Rao

Research Reports from the Department of Operations

As a result of the study of the length of service of 360 resigned and 360 currently employed registered nurses in a single general hospital in Cleveland, a Markov chain model is developed which predicts on the average the proportion of employees who leave and the proportion of employees who stay over any number of monthly time periods. While the Markov chain is a discrete time Markov process, the model has a time dependent feature. The transition probability matrix can be updated and accuracy will improve. This approach can be easily operationalized given the historical data regarding the total number …

Go to article

Nonlinear Optimization Using The Generalized Reduced Gradient Method, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner Oct 1973

Nonlinear Optimization Using The Generalized Reduced Gradient Method, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner

Research Reports from the Department of Operations

Generalized Reduced Gradient methods are algorithms for solving nonlinear programs of general structure. This paper discusses the basic principles of GRG, and constructs a specific GRG algorithm. The logic of a computer program implementing this algorithm is presented by means of flow charts and discussion. A numerical example is given to illustrate the functioning of this program.

Go to article

Market Survey For The Cleveland Zoological Park, Burton V. Dean, Hamilton Emmons, Keki R. Dadachanji Oct 1973

Market Survey For The Cleveland Zoological Park, Burton V. Dean, Hamilton Emmons, Keki R. Dadachanji

Research Reports from the Department of Operations

As Phase I of a market research study of the Cleveland Zoological Park, the socio-economic and demographic characteristics of the zoo visitor, actual and potential, have been investigated during the summer of 1973 through a series of on-site and telephone interviews. Further, the visitors opinions were solicited on various zoo-related subjects. Phase II, planned for 1974, will follow up with a series of controlled experiments and innovations seeking ways to increase both attendance and revenue. The results of Phase I are reported in this paper. The following visitor information has been collected and analyzed: geographic distribution, identity of decision-maker, frequency …

Go to article

Some Results For A Special Non-Stationary Markov Chain, S. Subba Rao Sep 1973

Some Results For A Special Non-Stationary Markov Chain, S. Subba Rao

Research Reports from the Department of Operations

In this report we consider a nonstationary Markov chain whose transition probabilities vary periodically in time. Such a Markov chain is in between a stationary and completely nonstationary chains. Such chains can be used to model stochastic situations where seasonalities or other such periodic phenomena are present. The structure of the process is examined in terms of the transition probability matrices for each period.

Go to article

A Method For Screening Student Applications For Award Of Financial Aid, S. Subba Rao, N. Mohan Aug 1973

A Method For Screening Student Applications For Award Of Financial Aid, S. Subba Rao, N. Mohan

Research Reports from the Department of Operations

The objectives of the present study are the following: 1) To study the profile of a student who declined the offer of admission (with or without financial aid). 2) To study the profile of a student who accepted the offer of admission (with or without aid) and joined the Department of Operations Research. 3) To discriminate between the above two types of students in (2) and (3). 4) To suggest how information in (3) can be used to make financial aid awards.

Go to article

Bimatrix Markovian Decision Processes And Stochastic Ratio Games, Vijaykumar V. Aggarwal Aug 1973

Bimatrix Markovian Decision Processes And Stochastic Ratio Games, Vijaykumar V. Aggarwal

Research Reports from the Department of Operations

Markov decision processes and stochastic games have been considered in this dissertation. An infinite planning horizon is assumed. Both discounted and undiscounted cash flows have been treated. In Markov decision process, a two-dimensional reward structure is considered and the objective criterion is to maximize the rate of return. It has been shown that a pure stationary optimal policy exists, whenever the rewards are finite and, in particular, the investment part of cash flow is positive. In the case of discounted cash flows, the optimal policy depends on the initial state the process is in. Finite algorithms have been proposed to …

Go to article

A Decision Model Of The Countdown Process, Burton V. Dean Aug 1973

A Decision Model Of The Countdown Process, Burton V. Dean

Research Reports from the Department of Operations

This paper examines two key decision problems in the countdown process: determining which tests and operations should be performed, and establishing their optimal sequence and duration. The authors posit that while potential actions can be enumerated at the start of the countdown, the actual sequence will depend on the system's state during the process. The paper aims to develop a methodology for solving these decision problems, viewing them as an adaptive process. Various modeling approaches are discussed, including game-theoretic models using "trees" to illustrate different countdown strategies, and search theory to find optimal action sequences. The authors also mention considering …

Go to article

A Counter Example In Location Theory, R. Chandrasekaran Aug 1973

A Counter Example In Location Theory, R. Chandrasekaran

Research Reports from the Department of Operations

This note settles an open question posed in [1] concerning certain location problems. An example is provided to show that some intuitive ideas are not true.

Go to article

A National Planning Model For Higher Education, Vaughn E. Huckfeldt Aug 1973

A National Planning Model For Higher Education, Vaughn E. Huckfeldt

Research Reports from the Department of Operations

This report presents the results of an initial research effort in the development of a national planning model for higher education. The design of the prototype model discussed in this report is based on existing or derivable (derived from basic data) institutional and student data and is designed to permit prototype planning studies to examine the impact of alternative federal programs on the accessibility of students to higher education, and to a lesser extent on the institutional viability (the ability to survive with a given level of funding). The model has assisted in identifying high payoff areas for future research …

Go to article

Some Results For Hyper-Exponential And Hyper-Poisson Queues, Shailesh J. Mehta, S. Subba Rao Aug 1973

Some Results For Hyper-Exponential And Hyper-Poisson Queues, Shailesh J. Mehta, S. Subba Rao

Research Reports from the Department of Operations

This paper examines steady-state queuing systems, focusing on hyper-exponential and hyper-Poisson queues. Explicit queue length probabilities, waiting time distributions, and related metrics are derived using an imbedded Markov chain technique for M|HE₂|1, HE₂|M|1, and M|HEₙ|1 systems. The analysis addresses stochastic service rates with multi-point distributions, providing solutions for busy period distributions in specific queuing models. A cubic equation for the Laplace transform of the busy period distribution is also presented, offering a detailed approach to understanding queue dynamics and performance metrics.

Go to article

Computational Experience With An Enumerative Algorithm For The Set Covering Problem With Base Constraints, Harvey M. Salkin, Chien-Hua Lin Jul 1973

Computational Experience With An Enumerative Algorithm For The Set Covering Problem With Base Constraints, Harvey M. Salkin, Chien-Hua Lin

Research Reports from the Department of Operations

An algorithm for the classical set-covering problem with additional "base" constraints is presented. The "base" constrained set covering problem is: Minimize cx, subject to Ex ≥ e, xj = 0 or 1 (j = 1,...,n), and Bx ≤ d. Here E is an m by n matrix of zeros and ones, e is an m column of ones, c and d are nonnegative vectors, and B is a nonnegative array having row diagonal structure. The algorithm is basically a zero-one single branch enumeration with linear programming and other feasibility criteria. A "heuristic" is used which sometimes finds an initial solution …

Go to article

Row Generalized Linear Programs, R. Chandrasekaran Jul 1973

Row Generalized Linear Programs, R. Chandrasekaran

Research Reports from the Department of Operations

A concept of row generalized linear programs is introduced. Illustrations of potential application for this concept are provided, along with methods for solving the row generalized linear program. The duality between row and column generalized linear programs is discussed.

Go to article

The Complementarity Problem Of Mathematical Programming, Arie Tamir Jun 1973

The Complementarity Problem Of Mathematical Programming, Arie Tamir

Research Reports from the Department of Operations

We consider the nonlinear complementarity problem: Find x in R^n such that: x ≥ 0 , f(x) ≥ 0 (1) x^T(f(x))=0 (2) where f is a given mapping satisfying f(0) = 0 and q is a vector in R^n. We say that the problem is feasible if (1) has a solution. f is said to be a Q-function if (1)-(2) has a solution for each q in R^n, and it is a P-function if the solution is unique for each q. Classes of functions are defined using properties of the complementarity problem (1)-(2), and sufficient conditions which guarantee that a …

Go to article

Gochurch : A Simulation Model For Forecasting Church Growth, John J. Rasmussen Jun 1973

Gochurch : A Simulation Model For Forecasting Church Growth, John J. Rasmussen

Research Reports from the Department of Operations

This paper examines the rapid growth of evangelical churches in America and introduces a simulation-based forecasting model, GOCHURCH, to aid in planning for future attendance. The model addresses the challenges faced by churches striving to meet aggressive growth targets while managing facility and program capacity. GOCHURCH predicts attendance numbers and provides structured descriptions of individuals influencing the growth process, using a Markovian framework to categorize the population into five states. A supporting questionnaire gathers data relevant to forecasting, and an initial simulation output demonstrates the model’s applicability to capacity planning. By analyzing membership trends and offering predictive insights, GOCHURCH helps …

Go to article

Optimal Flows In Networks With Positive Gains, Klaus Truemper May 1973

Optimal Flows In Networks With Positive Gains, Klaus Truemper

Research Reports from the Department of Operations

Simple, yet powerful non-simplex algorithms are developed for max flow and min-cost flow problems in networks with positive gains. It is shown that these algorithms are computationally better than existing non-simplex algorithms. A strong relationship between the min-cost flow problem in pure networks and the max flow problem in networks with positive gains is used to demonstrate how algorithms for one problem can be transformed into ones for the other problem.

Go to article

One Machine Sequencing To Minimize Mean Flow Time With Minimum Number Tardy, Hamilton Emmons May 1973

One Machine Sequencing To Minimize Mean Flow Time With Minimum Number Tardy, Hamilton Emmons

Research Reports from the Department of Operations

The problem of sequencing n jobs on one machine is considered, under the multiple objective of minimizing mean flow time with the minimum number of tardy jobs. A simple procedure is first proposed to schedule for minimum flow time with a specified subset of jobs on time. This is used in conjunction with Moore's Algorithm in a simple heuristic producing good and often optimal schedules. A branch-bound algorithm is presented to produce the optimal schedule efficiently with the help of several theorems which eliminate much branching.

Go to article

Some Approximate Results For A Heavily Loaded Single Server Queue With Semi-Markovian Services, S. Subba Rao May 1973

Some Approximate Results For A Heavily Loaded Single Server Queue With Semi-Markovian Services, S. Subba Rao

Research Reports from the Department of Operations

Some approximate results for a single server queue in which the service times form a semi-Markov process and which is non-equilibrium (traffic intensity > 1) is considered. Approximate results for mean queue length and waiting time have been given.

Go to article

Integer Programming : Branch And Bound Enumeration (Land And Doig [17]), Harvey M. Salkin May 1973

Integer Programming : Branch And Bound Enumeration (Land And Doig [17]), Harvey M. Salkin

Research Reports from the Department of Operations

Revised version of the original chapter written December 1971. This work represents the sixth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.

Go to article

All-Integer Integer Programming Algorithms Applied To Tableaux With Rational Coefficients, Harvey M. Salkin, Shailesh J. Mehta, Pradip H. Shroff Apr 1973

All-Integer Integer Programming Algorithms Applied To Tableaux With Rational Coefficients, Harvey M. Salkin, Shailesh J. Mehta, Pradip H. Shroff

Research Reports from the Department of Operations

It is shown that an initial all integer tableau is not necessary to the convergence of primal all-integer integer programming algorithms. It is well known that an analogous result holds for Gomory's dual all integer method, where only the cost row is required to be integer. We also show that the cost row need not be integer for the convergence of Gomory's dual all integer method.

Go to article

Expanded Dental Practice Management: Economics And Scheduling - Progress Report I, Arnold Reisman, Hamilton Emmons, Ronald Occhionero, Edward J. Green, Susumu Morito, Shailesh J. Mehta, Thomas S. Nunnikhoven Apr 1973

Expanded Dental Practice Management: Economics And Scheduling - Progress Report I, Arnold Reisman, Hamilton Emmons, Ronald Occhionero, Edward J. Green, Susumu Morito, Shailesh J. Mehta, Thomas S. Nunnikhoven

Research Reports from the Department of Operations

Efficient management of a dental practice involves many complex and interacting decisions. Primary decisions involve the size of the practice; that is, the number of operatories and the numbers of workers of various skills. A complicating factor in this regard is the introduction of the expanded duty auxiliary, or dental nurse, a new category of para or allied professional. Integration into practice of this new worker increases the number of available options. Case Western Reserve University School of Dentistry is one of several dental schools pioneering the TEAM Concept. Dental students are being trained to use expanded duty auxiliaries, and …

Go to article

First Prev Next Last