Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Business Administration, Management, and Operations (1196)
- Social and Behavioral Sciences (21)
- Human Resources Management (13)
- Organizational Behavior and Theory (13)
- Nonprofit Administration and Management (8)
-
- Finance and Financial Management (7)
- Entrepreneurial and Small Business Operations (6)
- Leadership (5)
- Marketing (5)
- Training and Development (5)
- Accounting (4)
- Business Law, Public Responsibility, and Ethics (4)
- Business and Corporate Communications (4)
- Corporate Finance (4)
- Economics (4)
- Law (4)
- Psychology (4)
- Communication (3)
- Education (3)
- Industrial and Organizational Psychology (3)
- Management Information Systems (3)
- Medicine and Health Sciences (3)
- Operations and Supply Chain Management (3)
- Performance Management (3)
- Public Affairs, Public Policy and Public Administration (3)
- Sociology (3)
- Sociology of Religion (3)
- Strategic Management Policy (3)
- Arts and Humanities (2)
- 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 (42)
- 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)
- Organizational behavior (23)
- Branch and bound algorithms (22)
- Computational complexity (22)
- Flexible manufacturing systems (22)
- Inventory control (22)
- Simulation methods (22)
- Computer simulation (21)
- Entrepreneurship (20)
- Manpower planning (19)
- Programming (Mathematics) (19)
- Publication Year
- Publication
- Publication Type
Articles 871 - 900 of 1238
Full-Text Articles in Business
Some Problems In Location Theory, Marcos J.A.P. Pacca
Some Problems In Location Theory, Marcos J.A.P. Pacca
Research Reports from the Department of Operations
This dissertation deals with four problems in Location Theory, in which all the distances involved are Euclidean distances. The first problem is the Min-max-one-location problem with arbitrary positive weights. An algorithm to solve the problem of minimizing a ratio of a convex quadratic over a positive linear function subject to a convex set bound by linear constraints is given. It is shown that this ratio problem can be solved by parametrically solving quadratic programming problems. Complementary Pivot Theory is used (Cottle and Dantzig [10]). It is shown that Hearn's Fractional Dual [26], which provides the solution to the Min-max-one-location problem …
Optimization Models For Offshore Oil Field Development, Luiz Roberto Ferreira Da Costa
Optimization Models For Offshore Oil Field Development, Luiz Roberto Ferreira Da Costa
Research Reports from the Department of Operations
Three optimization models for offshore oil field development are studied: the platform location problem, the dual completion problem, and the scheduling problem in the drilling operation. Either more efficient procedures are proposed, or a better characterization for the optimal policy is obtained. The decision variables in the platform location problem are: the number, size and location of drilling platforms, and the allocation of targets to platforms so as to develop a field at a minimum cost. The "exact" solution for this problem is found when the platform cost is an increasing convex function of its size, via a linear programming …
The M/G/1 Queue In Heavy Traffic And Its Covariance Function, Teunis J. Ott
The M/G/1 Queue In Heavy Traffic And Its Covariance Function, Teunis J. Ott
Research Reports from the Department of Operations
Let X(t) be the virtual waiting-time process of a stable M|G|1 queue. Let R(t) be the covariance function of the stationary process X(t), B(t) the busy-period distribution of X(t); and let E(t) = P{X(t) = 0|X(0) = 0}. For X(t) some heavy-traffic results are given, among which limiting expressions for R(t) and its derivatives and for B(t) and E(t). These results are used to find the covariance function of stationary Brownian Motion on [0,∞).
The Feasibility Of A Faculty Research Profiles Information System At Case Western Reserve University, Burton V. Dean, John N. Barrer
The Feasibility Of A Faculty Research Profiles Information System At Case Western Reserve University, Burton V. Dean, John N. Barrer
Research Reports from the Department of Operations
This paper reports on the methods used and results obtained in the evaluation of the feasibility of a faculty research profile information system. The study is based on a previous study which established the flow of administrative and background information during the various stages of the research process.* A methodology for use in the conduct of this study is developed, along with questionnaires and interviewing procedures. Statistical tests are developed and applied to determine the specific reasons for information processing improvements. Alternative systems for accomplishing information requirement goals are proposed and evaluated using cost and benefit criteria. A sequential strategy …
The Covariance Function Of The Virtual Waiting-Time Process In An M/G/1 Queue, Teunis J. Ott
The Covariance Function Of The Virtual Waiting-Time Process In An M/G/1 Queue, Teunis J. Ott
Research Reports from the Department of Operations
Let R(t) be the covariance function of the stationary virtual waiting-time process of a stable M|G|1 queue. It is proven that if R(t) exists, i.e., if the service-times have a finite third movement, then R(t) is positive and convex on [0,∞), with an absolutely continuous derivative R' and a bounded, non-negative second derivative R". Also, lim R(t) = 0 and R" can not be chosen monotone. Contrary to a finding by Beneš (1957) it is proven that ∫₀^∞ R(t) dt < ∞ if and only if the service-times have a finite fourth moment.
Scheduling Intermittently Arriving Jobs To Minimize The Weighted Number Tardy, Keki R. Dadachanji
Scheduling Intermittently Arriving Jobs To Minimize The Weighted Number Tardy, Keki R. Dadachanji
Research Reports from the Department of Operations
The problem of scheduling n jobs on one machine to minimize the weighted number tardy is considered, when job arrival times, processing times, due dates and weights are given constants. It is assumed that jobs may be interrupted at any time, and later resumed without penalty. A taxonomy of special cases for this problem is developed. Polynomial-bounded algorithms are given for some of the special cases and some other special cases are shown to belong to the set of NP-complete problems. A branch-bound solution is presented for the case in which all jobs have the same weight. The algorithm is …
A Comparison Of Research Administration Costs And Performances At A Sample Of Major U. S. Universities, Burton V. Dean, John N. Barrer, Raghavendra N. Rao
A Comparison Of Research Administration Costs And Performances At A Sample Of Major U. S. Universities, Burton V. Dean, John N. Barrer, Raghavendra N. Rao
Research Reports from the Department of Operations
As part of an ongoing study of research administration methods and procedures at Case Western Reserve University, a survey of research administrators at a sample of major U.S. institutions of higher education was conducted. A written questionnaire was completed at the time of the interview. Information was collected on (1) annual university budget and research income; (2) faculty size and number of proposals submitted and awarded; and (3) research administration size, manpower, distribution, income, budget, and task performance. Research administration performance was evaluated for each of the institutions. A measure of performance was positively correlated with the annual research income …
Forest City/University Hospitals Telemedicine System Project Evaluation: Progress Report Ii, F. J. Staub, D.W. Eastwood, W. Pittard, Edward A. Ernst, J. S. Gravenstein, Hamilton Emmons, Teunis J. Ott, Burton V. Dean, Arnold Reisman, P. Chou, Thomas George, Marylou Kiley, Pauline Crawford, Ronella Fields, Willie Callaham Lambright, Dennis L. Snyder, Charles S. Berry, M. Sabio
Forest City/University Hospitals Telemedicine System Project Evaluation: Progress Report Ii, F. J. Staub, D.W. Eastwood, W. Pittard, Edward A. Ernst, J. S. Gravenstein, Hamilton Emmons, Teunis J. Ott, Burton V. Dean, Arnold Reisman, P. Chou, Thomas George, Marylou Kiley, Pauline Crawford, Ronella Fields, Willie Callaham Lambright, Dennis L. Snyder, Charles S. Berry, M. Sabio
Research Reports from the Department of Operations
In June 1974, a task force comprised of faculty from the School of Medicine and faculty and graduate students from the Department of Operations Research, Case Western Reserve University, in association with the staff of Forest City Hospital, Cleveland, initiated an evaluation study of a proposed Telemedicine Link between University Hospitals of Cleveland and Forest City Hospital. The different stages of the Telemedicine study completed to date are: a definition of the project goals and objectives; formulation of parameters relevant to an evaluation of Telemedicine's impact on the quality of care delivered; design of data gathering instruments; and, finally, the …
Optimal Design Of Networks With Node Weighted Functions, Shailesh J. Mehta
Optimal Design Of Networks With Node Weighted Functions, Shailesh J. Mehta
Research Reports from the Department of Operations
The design of optimal networks on a set of points is an interesting and important problem. However, the majority of work done so far is in flow problems and on graphs with arc weights. In this dissertation, the problem of constructing optimal networks with node weights is considered. The objective function depends on the weights assigned to the nodes and the degree of the nodes. Special cases of the general design problem of constructing networks or graphs with node weights and arc weights are also treated. The intent of the research was to develop polynomially bounded algorithms. The general design …
Economic Lot Size Determination In Multi-Item, Multi-Level Production-Inventory Systems With Acyclic Network Structures, Phiroz P. Darukhanavala
Economic Lot Size Determination In Multi-Item, Multi-Level Production-Inventory Systems With Acyclic Network Structures, Phiroz P. Darukhanavala
Research Reports from the Department of Operations
The research presented here is oriented toward a company organized as a multi-level, production-inventory system, which can be represented by an acyclic network structure. In our model, we consider dependent stochastic demand and incorporate the concept of service level along with the associated costs of carrying safety stocks at different levels of the manufacturing chain. We develop and test an algorithm that specifically derives the dependent demand distributions and then computes optimal order quantities based on a trade-off between setup, holding, and safety stock costs at all levels. The algorithm, which is iterative in nature, can be easily incorporated into …
Antipollution Activities In Input-Output Analysis: An Application To Water Quality Management, Kwang-Soo Lee
Antipollution Activities In Input-Output Analysis: An Application To Water Quality Management, Kwang-Soo Lee
Research Reports from the Department of Operations
This thesis is concerned with the following problems involved in the analysis of economic systems with antipollution activities: (i) a mathematical formulation of the problem of determining their equilibrium, (ii) a solution technique for this model, (iii) approximation of interregional transaction figures, and (iv) the formulation of a general model for water quality management of a watershed basin economy. Extending the Leontief input-output model, an economic system with pollution abatement activities is formulated as a complementarity problem with upper bounding constraints. The complementarity problems for M-matrices are studied, and it is shown that the model is always feasible and that …
Corporate Tax Structures And A Special Class Of Set Partitioning Problems, Chien-Hua Lin
Corporate Tax Structures And A Special Class Of Set Partitioning Problems, Chien-Hua Lin
Research Reports from the Department of Operations
This thesis discusses a special integer program, a complete set partitioning problem in context of a real world situation; namely, that of paying unemployment compensation tax. In the United States, employers are required to pay contribution to a state administered unemployment compensation fund to protect the employees in the event of unemployment. A corporation can often be considered as a composition of subsidiaries, each with their own accounting data. In many states including Ohio, these subsidiaries may be treated individually or in various aggregations, each aggregation becoming a subsidiary, prior to computing the contribution payment. The payment is a function …
Determining And Responding To The Demand For Residential Products In Metropolitan Areas, Barry Marshall Richmond
Determining And Responding To The Demand For Residential Products In Metropolitan Areas, Barry Marshall Richmond
Research Reports from the Department of Operations
This thesis describes the development and subsequent use of a comprehensive model of the community development process designed to aid management in evaluating the long-term demand for residential products within a given metropolitan area (or series of areas) and then in determining an optimal development response to this demand. The presentation is divided into three parts, followed by a set of Technical Appendices. The first two parts treat the two tasks identified above. The final part is devoted to a presentation of some results which were obtained with the model in an actual application to a new community presently under …
Optimal Rearrangement Of Objects, Ashok Kumar Mittal
Optimal Rearrangement Of Objects, Ashok Kumar Mittal
Research Reports from the Department of Operations
This dissertation deals with finding an optimal way of changing a given arrangement to a (specified) new arrangement. Two types of problems are considered. In the first type of problem, there is no extra storage space available for storage of the objects. The rearrangement is done by a sequence of pairwise exchanges. In the second type of problem there is extra storage space available for storage. The rearrangement in this case is done by a vehicle which moves one object at a time. Problems are further classified by type of arrangement as basic cycles, cycles--and general arrangement- and by the …
Transient Distributions Of Some Processes Related To The Wiener Process With Drift, Teunis J. Ott
Transient Distributions Of Some Processes Related To The Wiener Process With Drift, Teunis J. Ott
Research Reports from the Department of Operations
This report presents an alternative derivation for the transient distribution of Brownian Motion Processes on [0,∞) with drift and a reflecting boundary at zero. The result is applied to determine the joint distributions of the maximum and minimum values of the process X_H over specified intervals. The Brownian Motion Process is also examined on (−∞,∞) with drift but without boundaries. The findings extend known results to cases with drift, offering broader insights into the behavior of Brownian motion processes under these conditions.
Critical Path Problem Under Assignment Constraints With The Number Of Men Less Than The Number Of Activities, S. Kumar, D. Wagner, R. Chandrasekaran
Critical Path Problem Under Assignment Constraints With The Number Of Men Less Than The Number Of Activities, S. Kumar, D. Wagner, R. Chandrasekaran
Research Reports from the Department of Operations
The paper concerns the problem of determining the shortest time of project completion under the constraint that the number of men available is less than the number of activities to be performed. Additionally, it is assumed that men differ in skills. In order to solve this problem, two related problems are formulated. The first one does not take into account the constraint that a man cannot perform more than one job at a time. The second one is discrete in time and is used to make a solution of the former problem feasible. An iterative procedure for solving the basic …
Progress Report Intensive Care For Neonates In Ohio, I, Teunis J. Ott, M. Anvari
Progress Report Intensive Care For Neonates In Ohio, I, Teunis J. Ott, M. Anvari
Research Reports from the Department of Operations
The Neonatal Project is a research project undertaken by faculty and staff from the departments of Operations Research in the School of Management and Pediatrics in the School of Medicine, Case Western Reserve University. Phase I of the project (Jan. 1 - June 30, 1975) is funded by the State of Ohio Department of Health. The ultimate purpose of the project is to produce well documented recommendations on locations of Intensive Care Units for Newborns (to be called "NICU's") in the state of Ohio, and if possible, to produce well documented recommendations on the modes of transportation to be used …
Aggregating Corporate Subsidiaries Under A Given Tax Structure, Harvey M. Salkin, Burton V. Dean, Chien-Hua Lin
Aggregating Corporate Subsidiaries Under A Given Tax Structure, Harvey M. Salkin, Burton V. Dean, Chien-Hua Lin
Research Reports from the Department of Operations
Employers in the United States are required to pay contribution to a state administered unemployment compensation fund to protect the employees in the event of unemployment. Contributions imposed by compensation laws are in reality taxes on the right to employ, and may be considered as direct costs. A corporation can often be considered as a composition of subsidiaries, each with their own accounting data. In many states including Ohio, these subsidiaries may be treated individually or in various aggregations, each aggregation becoming a subsidiary, prior to computing the contribution payment. The payment is a function of a known tax schedule …
Some Algorithms For Solving Extreme Point Mathematical Programming Problems, S. Kumar, D. Wagner
Some Algorithms For Solving Extreme Point Mathematical Programming Problems, S. Kumar, D. Wagner
Research Reports from the Department of Operations
The paper concerns some algorithms for solving extreme point mathematical programming problem formulated in [4]. The algorithms discussed consist in determining lower and upper bounds of the objective function and accomplishing the search for the optimal solution. The direction of search depends upon the choice of the starting point. It can be either lower or upper bound. Algorithms making use of the two possible search direction are discussed in detail. In order to illustrate the application of these algorithms, two numerical examples are solved. Some other algorithms based on different approaches are also briefly discussed.
Design And Testing Of A Generalized Reduced Gradient Code For Nonlinear Optimization, Leon S. Lasdon, Allan D. Waren, Arvind Jain, Margery W. Ratner
Design And Testing Of A Generalized Reduced Gradient Code For Nonlinear Optimization, Leon S. Lasdon, Allan D. Waren, Arvind Jain, Margery W. Ratner
Research Reports from the Department of Operations
Generalized Reduced Gradient (GRG) Methods are algorithms for solving nonlinear programs of general structure. An earlier paper [1] discussed the basic principles of GRG and presented the preliminary design of a GRG computer code. This paper describes a modified version of that initial design, including the experiences that led to the modifications. This paper also is intended to serve as partial system documentation. The code is compared computationally with an interior penalty function code, and anticipated future work on the algorithm is outlined.
Optimal Design Of Water Distribution Pipeline Networks, Wilson Carlos Duarte Delfino
Optimal Design Of Water Distribution Pipeline Networks, Wilson Carlos Duarte Delfino
Research Reports from the Department of Operations
A water distribution pipeline network is a system that transports water from points of supply to points of demand where water must be delivered at a certain rate and pressure head. The system consists of water supply points, water demand points and pumping stations all connected by pipelines according to some network geometry. In this paper we consider the one-period deterministic design problem of a water distribution pipeline network. The design problem in water networks with no loops (tree networks) and in water networks with loops, respectively, is mathematically formulated with pipe costs, pump costs and energy costs being minimized. …
Integer Programming By Group Theory: Some Computational Results, Harvey M. Salkin, Susumu Morito
Integer Programming By Group Theory: Some Computational Results, Harvey M. Salkin, Susumu Morito
Research Reports from the Department of Operations
A group theoretic algorithm for the integer program has been computer programmed and tested. It basically consists of a linear programming algorithm, a routine which converts the (relaxed) integer program to a group minimization problem (over the fractional column group or the isomorphic factor group attained via Smith's Normal Form), solving the group problem by dynamic programming or by a shortest path algorithm, and when necessary, uses a branch and bound procedure. Details and computational results are given. Future work regarding other computational strategies available to group theoretic algorithms is also included.
Innovation And Industrial Product Life Cycles : A Heuristic Classification Study, Cornelis A. De Kluyver
Innovation And Industrial Product Life Cycles : A Heuristic Classification Study, Cornelis A. De Kluyver
Research Reports from the Department of Operations
This study evaluates the validity of the product life cycle (PLC) concept for industrial products and explores its relationship to product innovation. Focusing on steering gears for heavy-duty trucks and farm machinery, the research refines and applies the PLC model, traditionally used for consumer goods, to industrial settings. Findings demonstrate three distinct life cycle forms—innovative maturity, growth maturity, and decline maturity--each influenced by the degree of product innovation. Using discriminant analysis, the study confirms a link between PLC stages and innovation, revealing that highly innovative products have greater sensitivity to discount factors in sales forecasting. Strategic insights include the advantage …
Some Faculty Evaluation Methods, John J. Rasmussen
Some Faculty Evaluation Methods, John J. Rasmussen
Research Reports from the Department of Operations
This paper reviews necessary and desirable characteristics of faculty, as suggested by both their peers and their students. Several surveys of student opinion regarding their teachers are discussed, along with problems of various rating methods. Two faculty rating models are described, though again with admitted shortcomings. A synthesized, viable scoring model for evaluating faculty members for promotion is proposed, and is followed by extensions of this to other educational institution uses.
Forest City/University Hospitals Telemedicine System Project Evaluation: Progress Report I, Edward A. Ernst, Arnold Reisman, Teunis J. Ott, Marylou Kiley, Thomas George, P. Chou, Pauline Crawford, Dennis L. Snyder, Willie Callaham Lambright, Ronella Fields, Charles S. Berry, Donald Brittenum
Forest City/University Hospitals Telemedicine System Project Evaluation: Progress Report I, Edward A. Ernst, Arnold Reisman, Teunis J. Ott, Marylou Kiley, Thomas George, P. Chou, Pauline Crawford, Dennis L. Snyder, Willie Callaham Lambright, Ronella Fields, Charles S. Berry, Donald Brittenum
Research Reports from the Department of Operations
In June 1974, a task force comprised of faculty from the School of Medicine and faculty and graduate students from the Department of Operations Research, Case Western Reserve University, in association with the staff of Forest City Hospital, Cleveland, initiated an evaluation study of a proposed Telemedicine Link between University Hospitals of Cleveland and Forest City Hospital. The different stages of the Telemedicine study completed to date are: a definition of the project goals and objectives; formulation of parameters relevant to an evaluation of Telemedicine's impact on the quality of care delivered; design of data gathering instruments; and, finally, the …
A Systems Description Of The Cwru Research Administration System, Burton V. Dean, R. Chandrasekaran, Leon S. Lasdon, S. Subba Rao, Michael Baum, Henry Adamany, Joel Brandon, Urban Landreman, Raghavendra N. Rao, Daniel Schwee
A Systems Description Of The Cwru Research Administration System, Burton V. Dean, R. Chandrasekaran, Leon S. Lasdon, S. Subba Rao, Michael Baum, Henry Adamany, Joel Brandon, Urban Landreman, Raghavendra N. Rao, Daniel Schwee
Research Reports from the Department of Operations
This paper is an attempt to fully describe the research administration process at Case Western Reserve University. Included in the description are decisions made during the process, flows of information, description of the offices involved, and suggestions for areas of improvement in this complex system. The paper has been divided into four major sections. The first deals with an in-depth description of all the major systems and subsystems of the Case Western Reserve Research Administration Process. The second part of the paper deals with a detailed description of the major university offices which are involved with the research process. The …
A Survey Of Large Scale Mathematical Programming, Leon S. Lasdon
A Survey Of Large Scale Mathematical Programming, Leon S. Lasdon
Research Reports from the Department of Operations
This chapter explores the extensive use of mathematical programming enabled by advanced computer codes capable of solving large-scale problems by leveraging problem structure. It highlights the special characteristics of large linear and nonlinear programs, such as sparse and structured constraint matrices. Two primary approaches to solving such problems are discussed: direct methods and decomposition techniques. Direct methods, commonly applied in linear programming using tools like the simplex method, optimize computations by exploiting matrix structures. Decomposition methods divide problems into subsystems, coordinating interactions through multi-level approaches to achieve comprehensive solutions. The chapter assumes familiarity with linear programming concepts and provides detailed …
A Market Analysis For The Cleveland Zoological Park, Hamilton Emmons, Burton V. Dean, Thomas S. Nunnikhoven, D.R. Rossiter, Raghavendra N. Rao, Cornelis A. De Kluyver, B. Richmond
A Market Analysis For The Cleveland Zoological Park, Hamilton Emmons, Burton V. Dean, Thomas S. Nunnikhoven, D.R. Rossiter, Raghavendra N. Rao, Cornelis A. De Kluyver, B. Richmond
Research Reports from the Department of Operations
The Cleveland Zoological Park has experienced, over the past decade, a general trend toward increasing deficits and decreasing attendance (see Appendix A). The Zoo is a nonprofit organization, rendering services to the community in such areas as education, conservation, community enhancement, and cultural enrichment. Through the Metropolitan Park Board, it receives an annual subsidy of $300,000. In spite of this subsidy and a significant increase in donated funds, coupled with repeated admission and parking fee increases, even the most frugal management has been unable to make income meet expenses. Certainly, nothing has been left over for capital investments in new …
A Study Of Presidents Of Religious Institutions Of Higher Learning In California, John J. Rasmussen, Burton V. Dean
A Study Of Presidents Of Religious Institutions Of Higher Learning In California, John J. Rasmussen, Burton V. Dean
Research Reports from the Department of Operations
Religious related institutions will most likely continue to exist, and they will continue to need administrators. To become familiar with the current crop of these academic elite, a significant number of presidents and other administrative officers were interviewed regarding their family, educational, and work background; their current methods of dealing with problem situations; and their perceptions regarding the future of the religious related school and the person who will run them.
Cleveland Public Heath And Welfare Department Courier Service Operations, Burton V. Dean, John N. Barrer, Krishnamurthy Nandakumar
Cleveland Public Heath And Welfare Department Courier Service Operations, Burton V. Dean, John N. Barrer, Krishnamurthy Nandakumar
Research Reports from the Department of Operations
It was found that consolidation of courier system resources is required to insure a minimum level of service in the event of driver absenteeism or unavailability of vehicles. In order to find common functions to use as principles of consolidation, each program was analysed on the basis of 1) Vehicle location, 2) Materials transported, 3) Areas serviced, and 4) Type of service provided. Analyses were performed to determine the advantages of consolidation with respect to cost savings and improved reliability of service. It was determined that consolidation was possible because of the similarities in the types of service being provided …