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 991 - 1020 of 1238
Full-Text Articles in Business
Stockage And Transfer Rules For Multilocation Inventory Control, Chandrasekhar Das
Stockage And Transfer Rules For Multilocation Inventory Control, Chandrasekhar Das
Research Reports from the Department of Operations
A multilocation stochastic inventory problem is dealt with in this dissertation. It is assumed that stock is supplied from a central source and there exists a provision for transfer of stock over the locations. The stockage and transfer decisions are assumed to be centralized. The redistribution is made on the basis of stock review at predetermined points in time between every two consecutive procurement opportunities. Under certain regularity conditions, the optimality of a simple class of transfer rules is established for the two-location system. The optimal stockage rule is also characterized for this system on the supposition that interim transfers …
Optimal Scheduling Of One-Shot Projects, Thomas L. Morin
Optimal Scheduling Of One-Shot Projects, Thomas L. Morin
Research Reports from the Department of Operations
This study addresses itself to the scheduling and sequencing aspects of some major capital expenditure planning problems. Specifically, several models for the scheduling and sequencing of systems of durable, high-cost ("one-shot") projects, which in the aggregate are subject to a number of continuous-time demand requirements, are formulated and analyzed. Project selection, sequencing and timing decisions which constitute minimum-cost strategies are determined for various identifiable cases via mathematical programming. In particular, the special structure of this class of continuous time combinatorial decision problems is exploited, leading to the development of several efficient dynamic programming algorithms for the solution of deterministic multi-dimensional …
A Preliminary Report: Economic Effects Of Female Discrimination, Burton V. Dean, Burton V. Dean, David E. Sands
A Preliminary Report: Economic Effects Of Female Discrimination, Burton V. Dean, Burton V. Dean, David E. Sands
Research Reports from the Department of Operations
1964 was the year of passage of the Civil Rights Act Title VII of which addressed itself to the question of discrimination in employment because of sex. Since then, however, many companies have taken advantage of the lack of federal prosecution under this law. In the past few years, a few cases have been tried under this law but no appreciable headway was made in the fight against discrimination. This paper is a discussion of one of the methods by which the practice and effect of discrimination against women in hiring, firing, layoff rehiring and unequal pay can be proved. …
Application Of Pert In Plant Construction Scheduling In The Ohio Brass Company, Burton V. Dean, Samuel Jackson Mathis, Vaughn E. Huckfeldt
Application Of Pert In Plant Construction Scheduling In The Ohio Brass Company, Burton V. Dean, Samuel Jackson Mathis, Vaughn E. Huckfeldt
Research Reports from the Department of Operations
The use of PERT on the Ohio Brass Project was successful in establishing a controlled review of all of the important tasks in the project and resulted in new awareness by the ITA project managers of the benefits obtained from good project control. This is illustrated by the desire to expand similar project control efforts on all future ITA projects. The objectives established by UAI iii assisting ITA in the use of modern project management techniques and in the use of existing time- sharing computer services will have been highly educational to ITA, and very satisfactorily completed: This project will …
Algorithms For Discounted Stochastic Games: A Comparison Of Efficiency, Vijaykumar V. Aggarwal
Algorithms For Discounted Stochastic Games: A Comparison Of Efficiency, Vijaykumar V. Aggarwal
Research Reports from the Department of Operations
There are two algorithms for the solution of two person zero sum stochastic games with a finite number of states or positions and where future payoffs are discounted. The first algorithm is on somewhat similar lines as that of Hoffman and Karp for the undiscounted case, and the second one is recently developed by Rao, Chandrasekaran and Nair. This paper presents computer programs for the two algorithms and computational experiments for comparing the efficiency of the algorithms. The results show that the second algorithm requires fewer iterations and moreover, the computation time for each iteration in this is significantly lower. …
A Dual All-Integer Algorithm (In Revised Simplex Form) For The Set Covering Problem, Harvey M. Salkin, Ronald D. Koncal
A Dual All-Integer Algorithm (In Revised Simplex Form) For The Set Covering Problem, Harvey M. Salkin, Ronald D. Koncal
Research Reports from the Department of Operations
In an earlier work ("A Pseudo Dual All-Integer Algorithm for the Set Covering Problem", Department of Operations Research Tech. Memo. No. 204, CWRU, Nov. 1970) the authors developed a composite dual simplex-Gomory all integer algorithm for the (inequality or equality) set covering problem (i.e., minimize cx subject to Ex >= e or Ex = e, xj = 0 or 1; where E is an m by n zero-one matrix, e is a column of ones, and c is a nonnegative integral row). Essentially the algorithm performs dual simplex iterations whenever unit pivots are available and it adjoins Gomory all integer …
Scheduling Stochastic Networks With Gert, Vijaykumar V. Aggarwal
Scheduling Stochastic Networks With Gert, Vijaykumar V. Aggarwal
Research Reports from the Department of Operations
Concepts of stochastic network have been defined and GERT analysis has been presented for them. Various Systems which present complex logical elements, uncertain activities, multi-sources and multiple terminals and for which very often only intuitive judgement had to be applied, can be easily formulated in a concise and compact network form. Methods of computation for various performance measures have been given and they can help in decision-making.
Nonserial Dynamic Programming - A Guided Tour, Augustine O. Esogbue, Barry Randall Marks
Nonserial Dynamic Programming - A Guided Tour, Augustine O. Esogbue, Barry Randall Marks
Research Reports from the Department of Operations
Interest in nonserial dynamic programming is deeply rooted in real life applications. Since the initial efforts in the early 60's however, a number of scattered treatment of this interesting field of dynamic programming has emerged. This paper traces the development of nonserial dynamic programming from the basic theory underlying dynamic programming to the latest applications of nonserial dynamic programming. The works of such major contributors as Nemhauser, Wilde, Beightler, Bertele and Brioschi are critically examined and recent relevant computational advances are discussed. The paper is concluded with a few examples of various applications of nonserial dynamic programming together with some …
A Report On An Exploratory Development Project Evaluation Experiment, Burton V. Dean, Samuel Jackson Mathis, S. Srinivasan
A Report On An Exploratory Development Project Evaluation Experiment, Burton V. Dean, Samuel Jackson Mathis, S. Srinivasan
Research Reports from the Department of Operations
This paper describes the methods and results of an exploratory development project evaluation (EDPE) experiment aimed at developing a method for quantitatively evaluating research and development (R&D) projects. Conducted at the U.S. Army Material Command, the experiment utilized a modified DELPHI Method, employing iterative feedback among a panel of judges to reach consensus on critical factors affecting R&D projects. The panel assessed factor weights, project-factor values, and overall project scores over four sessions. Linear regression models were developed using weighted scores, with additional statistical tests performed to evaluate panel agreement, bias, and model predictive capability. Key findings include the sufficiency …
Algorithms For Discounted Stochastic Games, S. Subba Rao, R. Chandrasekaran, K.P. K. Nair
Algorithms For Discounted Stochastic Games, S. Subba Rao, R. Chandrasekaran, K.P. K. Nair
Research Reports from the Department of Operations
In this paper, a two person zero sum stochastic game with a finite state space is considered. The movement of the game from state to state is jointly controlled by the two players depending on their choice of strategies from a finite number of alternatives available to each player in each of the states. Considering an infinite number of transitions, Hoffman and Karp provided a convergent algorithm for the solution of this game when the future payoffs are not discounted. Subsequently, the authors presented a proof for a faster algorithm available in literature for solving the same problem. This paper …
Reduction Of Dimensionality In Dynamic Programming Of Higher Dimensions: A Comparative Study And Analysis Of Computational Aspects, Augustine O. Esogbue, Amar J. Singh
Reduction Of Dimensionality In Dynamic Programming Of Higher Dimensions: A Comparative Study And Analysis Of Computational Aspects, Augustine O. Esogbue, Amar J. Singh
Research Reports from the Department of Operations
One of the noble aims of dynamic programming at its conception -- namely, that of developing an operational method for the numerical solution of various control problems, is often thwarted for meaningfully scaled systems, by the curse of dimensionality. By far the most important contribution to modern dynamic programming is the development of efficient algorithms capable of being used, with present-day computational devices, to solve problems of a large-scale nature. Consequently, a number of algorithms have appeared in the literature in recent times, each geared towards ameliorating the above curse. The purpose of this paper is to present a didactic …
The Optimal Choice Of Corporate Growth Plans Under Risk, Roy B. Larson
The Optimal Choice Of Corporate Growth Plans Under Risk, Roy B. Larson
Research Reports from the Department of Operations
This study develops a sequence of five progressively realistic computational models for optimizing corporate growth plans under risk, combining advancements in security evaluation and capital budgeting. The final model integrates investment, financing, and dividend policy alternatives to maximize firm market value using a mathematical programming approach. Supporting contributions include a review of corporate planning practices in U.S. firms, analysis of corporate objectives, and enhancements to Weingartner’s programming model for growth plan selection. The Sharpe index model for portfolio selection is extended to a multi-period risk framework, while novel algorithms, MIC(X) and PMIC(Xs, Xb), address mixed-integer convex nonlinear programming problems. These …
Technical Management And Control Of Large-Scale Urban Studies: A Comparative Analysis Of Two Cases, Juri Pill
Technical Management And Control Of Large-Scale Urban Studies: A Comparative Analysis Of Two Cases, Juri Pill
Research Reports from the Department of Operations
This paper examines the factors influencing the success or failure of large-scale urban studies, focusing on two Cleveland-based projects: the Downtown Agency for Transportation Action (ALPHA) and the Output Evaluation of the Jewish Community Federation agencies (BETA). Using a systematic framework of qualitative descriptors, the study analyzes the processes, outcomes, and "soft" differences, such as interdisciplinary communication, derived from participant surveys. Key findings highlight the importance of technical collaboration between consultants and clients, flexible objectives, and individuals capable of bridging disciplinary and political gaps. The research also identifies challenges in integrating rational decision-making tools when isolated from end-users and navigating …
Supply And Demand Of Teachers And Supply And Demand Of Ph.D'S 1971-1980, Burton V. Dean, Arnold Reisman, Edward Rattner, Alfred R. Michenzi, Sun K. Kim, S. Srinivasan
Supply And Demand Of Teachers And Supply And Demand Of Ph.D'S 1971-1980, Burton V. Dean, Arnold Reisman, Edward Rattner, Alfred R. Michenzi, Sun K. Kim, S. Srinivasan
Research Reports from the Department of Operations
This study addresses concerns over a potential surplus of teachers and Ph.D. holders in the 1970s at Case Western Reserve University. A systematic approach was developed, including mathematical models linking student flows in higher education to teacher and Ph.D. production, methods for estimating teacher demand at various educational levels, and models for forecasting Ph.D. demand in industry and government. Statistical techniques were employed to derive parameters from historical data, supplemented by a consensus method to account for changes in technology, budget constraints, and policy. The study generated actionable recommendations and a methodology for the Office of Education to plan for …
Generalized Upper Bounding Methods In Production Scheduling And Distribution, Leon S. Lasdon
Generalized Upper Bounding Methods In Production Scheduling And Distribution, Leon S. Lasdon
Research Reports from the Department of Operations
Generalized Upper Bounding (GUB) is an efficient specialization of the Simplex Method for problems with disjoint rows of ones. The principles of the method are briefly reviewed, and an application to multi-item production scheduling is presented. A multifacility extension of the scheduling model is formulated and solved using GUB in conjunction with Bender's Partitioning algorithm. Application of GUB to integrated production and distribution problems is also discussed.
Quantitative Techniques For Research Program Planning In Structural Mechanics, Burton V. Dean
Quantitative Techniques For Research Program Planning In Structural Mechanics, Burton V. Dean
Research Reports from the Department of Operations
The Committee* has concluded that systematic procedures for research program formulation in structural mechanics have promise as methods for optimizing the allocation of research resources. Inasmuch as such procedures are not helpful in anticipating scientific breakthroughs, twenty-five per cent (25%) of the over-all research budget should be allocated, on the discretionary judgment of the Branch Staff Members, to fundamental research which has broad promise of application to Naval Missions. The matrix method is considered as the most promising planning technique. The Committee has recommended that a trial program be established within the Structural Mechanics Branch of the Office of Naval …
Application Of Preparedness Maintenance Policy, Vasant B. Kaujalgi
Application Of Preparedness Maintenance Policy, Vasant B. Kaujalgi
Research Reports from the Department of Operations
This report describes a maintenance policy of a nonmonitored part in the presence of a set of monitored parts. This policy is called (ni,N) policy. The applications of this policy to the maintenance of a standby power unit and to a fire extinguisher have been described with the actual data. The optimal values for these two examples have been computed. A possible extension of this model to a system consisting of a set of non-monitored parts in the presence of a set of monitored parts has been proposed.
A Systems Approach To Performance Evaluation In Baseball, Melvin Brown
A Systems Approach To Performance Evaluation In Baseball, Melvin Brown
Research Reports from the Department of Operations
This study examines baseball as a stochastic system, developing quantitative measures to evaluate player performance as batters and fielders. These measures offer significant advantages over traditional indices such as batting average, fielding average, and slugging percentage. The research also provides a prototype for creating performance metrics applicable in business, social, and governmental contexts. The study addresses the strategic problem of determining an optimal batting order by formulating it as a cubic assignment problem solvable via dynamic programming. A simplified version of baseball is defined to generate representative performance data. A computer program, running on an RCA Spectra 70/45 in time-sharing …
Analysis And Codification Of The Pre And Post Operative Anesthesia Related Tasks, Arnold Reisman, Augustine O. Esogbue, Peter M. Lewy, Vasant B. Kaujalgi, A. Tamir
Analysis And Codification Of The Pre And Post Operative Anesthesia Related Tasks, Arnold Reisman, Augustine O. Esogbue, Peter M. Lewy, Vasant B. Kaujalgi, A. Tamir
Research Reports from the Department of Operations
This study adapts traditional Industrial Engineering techniques to describe and codify tasks involved in anesthesia related services to patients in a large teaching hospital. Application is directed towards tasks carried out outside the operating room.
On The Uses Of Linear Regression Analysis In The Determination Of Continuous Utility Functions, Michael S. Salvador
On The Uses Of Linear Regression Analysis In The Determination Of Continuous Utility Functions, Michael S. Salvador
Research Reports from the Department of Operations
This paper investigates the characteristics of subjective estimation, specifically with regard to those techniques used in the measurement of utility as a function of some decision alternative. Regression analysis is applied to such bivariate estimates for the purpose of obtaining a generalized representation of the functional relationship expressed by same. Then, because of special properties of the subjective estimates themselves, certain statistics are shown to exist which simultaneously provide global measures of goodness of fit and consensus; furthermore, assuming the use of an iterative data collection process, there is also provided a measure of the rate of convergence of the …
Integer Programming : Primal All-Integer Programming, Harvey M. Salkin
Integer Programming : Primal All-Integer Programming, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the seventh chapter of a forthcoming textbook entitled “Integer Programming” to be written by Harvey M. Salkin.
Nonlinear Optimization With Upper And Lower Bounds, Vaughn E. Huckfeldt
Nonlinear Optimization With Upper And Lower Bounds, Vaughn E. Huckfeldt
Research Reports from the Department of Operations
Many nonlinear programming problems containing only upper and lower bounds are currently solved as unconstrained problems using transformation, or penalty methods of optimization. In this thesis it is shown that (1) Goldfarb's conjugate gradient algorithm can be simplified for NLP problems containing only upper and lower bounds, (2) the simplified algorithm requires less computer storage, and fewer multiplications per iteration with no loss in accuracy, and (3) the simplified algorithm is superior to transformation, or penalty methods when tested on published nonlinear test problems. A FORTRAN code for the nonlinear algorithm for upper and lower bounds, including complete documentation, is …
Integer Programming : Dual All-Integer Integer Programming (Gomory [2]), Harvey M. Salkin
Integer Programming : Dual All-Integer Integer Programming (Gomory [2]), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the sixth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. The cutting plane algorithm for the integer program presented in this chapter was developed by Ralph Gomory in 1960. Its similarity to the fractional method (Chapter 3) is principally due to the utilization of the (lexicographic) dual simplex method and the maintenance of (lexicographic) positive columns. The basic approach is, however, different from the fractional technique: there is no optimization, generating a constraint, reoptimization, etc. Rather, inequalities are generated at each iteration starting with the very first. Further, each of these …
An R & D Management Game, Klaus Truemper, Burton V. Dean
An R & D Management Game, Klaus Truemper, Burton V. Dean
Research Reports from the Department of Operations
The principles of R&D project management have been combined with an existing business management game. The paper outlines the critical elements of the game, provides an analysis of results-to-date, and suggests further extensions of the game.
Computational Experience With A Traveling Salesmen Algorithm, Joseph A. Svestka, Vaughn E. Huckfeldt
Computational Experience With A Traveling Salesmen Algorithm, Joseph A. Svestka, Vaughn E. Huckfeldt
Research Reports from the Department of Operations
A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation, certain subtours may satisfy the constraints, thus reducing the search. A very good initial tour and upper bound are employed. The determination of these as well as the pathology of the formulation and the algorithm are discussed. No increase in computation time over the one salesman …
Application Of Operations Research In Research Planning - A Case Study, Eric C. Johnson
Application Of Operations Research In Research Planning - A Case Study, Eric C. Johnson
Research Reports from the Department of Operations
In 1966 Kennecott Copper Corporation and its subsidiary, Chase Brass and Copper Company, launched a long range research effort--the Casting Laboratory-- designed to focus on the area of casting, specifically solidification and liquid metal processing. From the outset, the Casting Laboratory implemented formal activities for the identification and evaluation of research opportunities and activities so that the results could be used for long range planning of Casting Laboratory applied research programs. The author was responsible for these activities during 1967-1970. Drawing on specific activities carried out at the Casting Laboratory during the author's tenure there and activities in which he …
Timeliness Of Library Materials Delivery: A Set Of Priorities, Arnold Reisman, J.P. Herling, M.G. Fancher Beeler, G. Kaminski, S. Srinivasan
Timeliness Of Library Materials Delivery: A Set Of Priorities, Arnold Reisman, J.P. Herling, M.G. Fancher Beeler, G. Kaminski, S. Srinivasan
Research Reports from the Department of Operations
This paper describes work performed to obtain a set of aggregate priorities and of values for the timeliness of delivery of library materials. The priorities were expressed through a set of weights and utility curves for eleven categories of materials handled in whole or in part by approximately 800 libraries located in the Greater Cleveland area. To obtain the needed data a panel of librarians representing several types of libraries used the Delphi Method of arriving at consensus. The results described in this paper are being used as input information in a project aimed at establishing optimum library delivery truck …
Integer Programming : Dual Fractional Mixed Integer Programming (Gomory [2]), Harvey M. Salkin
Integer Programming : Dual Fractional Mixed Integer Programming (Gomory [2]), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the fourth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. The mixed integer programming algorithm developed by Ralph Gomory in 1960 and presented in this chapter is a direct extension of the integer programming algorithm discussed in Chapter 3. As before, the cutting plane technique utilizes the dual simplex method and allows fractional numbers in computation and is thus classified as "dual fractional." For ease of reference, we rewrite the basic approach.
Integer Programming : Dual Fractional Integer Programming (Gomory [3]), Harvey M. Salkin
Integer Programming : Dual Fractional Integer Programming (Gomory [3]), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the third chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. This chapter concerns itself with a cutting plane algorithm for the integer program which utilizes the dual simplex method and allows fractional numbers in computation - hence the "dual fractional" reference. We outline the basic approach for the integer program extension to the mixed case appears in the next chapter.
An Efficient One-Dimensional Search Procedure For Barrier Function, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner
An Efficient One-Dimensional Search Procedure For Barrier Function, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner
Research Reports from the Department of Operations
Interior penalty functions are a popular approach for solving non-linear constrained optimization problems. Most current methods for minimizing such functions require a one-dimensional minimization along specified search directions, and this can be quite difficult, since the function approaches +∞ along the boundaries of the feasible set. A special purpose algorithm is described which alleviates this difficulty by using a simpler approximating function which also goes to infinity near the boundary. Numerical results are presented, showing that the number of function evaluations and computation time are reduced by factors of about three and two respectively. The ideas are easily extended to …