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 961 - 990 of 1238
Full-Text Articles in Business
Anesthesiology Manpower Planning Study Phase Iii - Progress Report I, Arnold Reisman, F. J. Staub, Burton V. Dean, J.S. Gravenstein, Vijaykumar V. Aggarwal, Vasant B. Kaujalgi, Cornelis A. De Kluyver
Anesthesiology Manpower Planning Study Phase Iii - Progress Report I, Arnold Reisman, F. J. Staub, Burton V. Dean, J.S. Gravenstein, Vijaykumar V. Aggarwal, Vasant B. Kaujalgi, Cornelis A. De Kluyver
Research Reports from the Department of Operations
This interim report discusses the major aspects of recent results obtained in the Anesthesiology Manpower Planning Study. The report is intended to serve as a summary of work performed and as the basis of a comprehensive review of results obtained and methodology developed to date in Phase III of the study. The report is organized around the four major tasks of Phase III. First, the extension of the task analysis performed during Phase I deals with revisions made in the anesthesia task list, the inclusion of the concepts of condition-dependence and backup; and the development of a new set of …
The Knapsack Problem: A Survey, Harvey M. Salkin, Cornelis A. De Kluyver
The Knapsack Problem: A Survey, Harvey M. Salkin, Cornelis A. De Kluyver
Research Reports from the Department of Operations
A unifying survey of the literature related to the knapsack problem; that is, maximize Σᵢvᵢxᵢ, subject to Σᵢwᵢxᵢ ≤ W, xᵢ ≥ 0, and xᵢ integer; where vᵢ, wᵢ and W are known positive integers. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi-dimensional case, are also considered.
A Brief Survey Of Algorithms And Recent Results In Integer Programming, Harvey M. Salkin
A Brief Survey Of Algorithms And Recent Results In Integer Programming, Harvey M. Salkin
Research Reports from the Department of Operations
Several recent books and survey articles in integer programming have appeared in the literature. These are listed in the references. This is not another attempt at a detailed survey of a well surveyed field, but rather an outline of the basic techniques, important results, the classical special purpose problems and algorithms, and the available computer programs in integer programming. Hopefully, such a treatment can make the reader aware of the principle (general and special purpose) algorithms, results, and computer programs with a minimal amount of effort. Those interested in the details of a particular technique or result should consult the …
Set Covering: Uses, Algorithms, Results, Harvey M. Salkin, Jahar Saha
Set Covering: Uses, Algorithms, Results, Harvey M. Salkin, Jahar Saha
Research Reports from the Department of Operations
An up to date survey of the set covering literature. Applications, (useful) theoretical results, algorithms, computational experience, and existing computer programs are described. The relationships between set covering problems and graphs are also discussed. No attempt is made to detail proofs or algorithm development, but rather an understandable, somewhat brief, unifying survey is presented.
Variance Relationships For Stochastic Changes Of Discounted Cash Flow Formulae With Inflation As A Parameter, Ram Avtar, Arza K. Rao, Arnold Reisman
Variance Relationships For Stochastic Changes Of Discounted Cash Flow Formulae With Inflation As A Parameter, Ram Avtar, Arza K. Rao, Arnold Reisman
Research Reports from the Department of Operations
This paper extends the classical formulae for discounted cash flow analysis to account for assumed conditions of inflation.
An Approach To The Plant Capacity Expansion Problem By The Delphi Method And A Criterion Function: A Case Study, Burton V. Dean, Arnold Reisman
An Approach To The Plant Capacity Expansion Problem By The Delphi Method And A Criterion Function: A Case Study, Burton V. Dean, Arnold Reisman
Research Reports from the Department of Operations
This paper describes a study to develop a general method for use in the plant capacity expansion problem. The method was applied to and tested on a recent siting decision of a major manufacturing corporation. The facility location models as found in the current literature were examined and rejected because of (1) the limited, highly discrete set of feasible locations in the test problem, (2) the dependence of the decision on future as well as present costs, and (3) the need to include intangible values in the decision criteria. A decision table and a multiple criterion function incorporating both tangible …
Variance Relationships For Stochastic Changes Of Common Discounted Cash Flow Formula, Ram Avtar, Arza K. Rao, Arnold Reisman
Variance Relationships For Stochastic Changes Of Common Discounted Cash Flow Formula, Ram Avtar, Arza K. Rao, Arnold Reisman
Research Reports from the Department of Operations
Standard texts in Engineering Economy, and/or Economic Analysis develop and list equations for various cash flow analyses. In these texts the independent variables and/or parameters are assumed to be known deterministically. In practice, however, it is often possible to establish for such values the distribution and its parameters. This paper extends the stochastic formulations for each of the commonly used equations for various combinations and permutations of distributions in so far as the variances are concerned.
Integer Programming Models And Codes In The Urban Environment, Harvey M. Salkin, Warren L. Balinsky
Integer Programming Models And Codes In The Urban Environment, Harvey M. Salkin, Warren L. Balinsky
Research Reports from the Department of Operations
It is well known that many real world problems, in particular, many urban problems, can approximately be modelled as linear programs. The representations often become more precise when, in addition, some or all of the variables are integer constrained (e.g., a solution which indicates that 0.67 schools should be built is of little use to the practitioner). Hence, integer programming is of substantial importance in urban science. This article describes several general integer programming models for which efficient computer codes are available. In each case, applications in an urban environment are discussed. This list is not intended to be exhaustive, …
Opportunity, Value Theory And The Measurement Of Depreciation, Income, Goodwill And Worth, Miles Hartley Kennedy
Opportunity, Value Theory And The Measurement Of Depreciation, Income, Goodwill And Worth, Miles Hartley Kennedy
Research Reports from the Department of Operations
This study begins by developing axiomatically (in Chapter I) the opportunity value method of depreciation within a larger theory addressed simultaneously to valuing assets and to determining income for profit-seeking organizations. Though rather general in scope, there are a number of applications whose idiosyncrasies preclude the use of this method; the reader is forewarned of these in Chapter II. Chapter III then begins the investigation of the properties of this method by reviewing the depreciation requirements of the performance appraisal process and showing that the measurements produced by this method are--from this standpoint--superior to those of several of its well-known …
Synthesis Of A Crude Oil Supply System: A Non-Convex Network Problem, Samuel Jackson Mathis
Synthesis Of A Crude Oil Supply System: A Non-Convex Network Problem, Samuel Jackson Mathis
Research Reports from the Department of Operations
This problem involves the synthesis of a system to supply crude oil to refineries by transporting it in tankers that travel on various routes of a network. The costs involved are non-convex, which is assumed to mean that they are sufficiently non-linear to preclude approximations by convex functions, and specifically includes the possibility of integer-valued functions and fixed costs. The problem was inspired by considerations of a crude oil transshipment system, but the resulting formulation is sufficiently general to include many types of network problems with non-linear flows or costs, which can be discretized.
Some Mathematical Models Of The Housing Process, Andrew Frank Daughety
Some Mathematical Models Of The Housing Process, Andrew Frank Daughety
Research Reports from the Department of Operations
This thesis is concerned with the mathematical modeling of two problems in housing: the housing transition process and the allocation of manpower and strategies for code enforcement. The housing transition process, which includes upward conversion, abandonment, and demolition, is based on the use of quasi-stationary transition matrices produced by specially structured linear programs at each time period. A supply side, a demand side, and a demand-supply readjustment process are modeled. A linear program is specified for the code-enforcement allocation of manpower, while the allocation of strategies is approached through a Markovian Decision Process formulation. Remarks concerning the solution of Markovian …
Results On Matroids, Blocking Systems And Convex Sets, Bradley Hull
Results On Matroids, Blocking Systems And Convex Sets, Bradley Hull
Research Reports from the Department of Operations
Two algorithms for matroids are presented, and relations between matroids and blocking systems are explored. A method is presented for removing an element of one of the dual pairs of clutters which comprise a blocking system. The problem of how to "chop off" a vertex from a convex polyhedron without creating new vertices is dealt with. Bounds on the number of cutting planes are determined.
School Bus Routing By Integer Programming, Dynamic Programming, And Composite Algorithms, Harvey M. Salkin, Patrice Breining
School Bus Routing By Integer Programming, Dynamic Programming, And Composite Algorithms, Harvey M. Salkin, Patrice Breining
Research Reports from the Department of Operations
This paper proposes several models, and outlines seemingly efficient techniques for the school bus routing problem. Given the number of schools, buses and their capacities, the number of children, their location and destination, and distances or times between stops, the problem is to design a "best" (several criteria are given) series of bus routes. An integer programming, a dynamic programming, and several composite models and algorithms are proposed. By making reasonable assumptions computer storage problems may be substantially alleviated and implementation is possible in each case. As the problem is usually enormous, emphasis is placed on producing "good" solutions to …
Crossings Of Curves By A One-Dimensional Brownian Motion Process, Douglas Yates Rowland
Crossings Of Curves By A One-Dimensional Brownian Motion Process, Douglas Yates Rowland
Research Reports from the Department of Operations
The following result is proved: For any given continuous function and any T > 0, the set of points between zero and T where the sample path of a standard separable Brownian motion process intersects the graph of the function is almost surely either a perfect set or a set which is perfect if the origin is removed. Sufficient conditions are given for that set to be perfect and sufficient conditions are given for it to be perfect if the origin is removed.
A Design Methodology For Automated Inspection, Donald Henrik Kylin
A Design Methodology For Automated Inspection, Donald Henrik Kylin
Research Reports from the Department of Operations
A class of industrial inspection problems, important because it often causes production bottlenecks, is posed as a pattern recognition problem. A typical member of this class is the inspection of surface quality in flat-rolled steel. Varying inspection requirements, the limitations of manual visual inspection, and the production potential of modern plants motivate research into automatic inspection. Operations research methodologies are applied to three outstanding problems in applied pattern recognition in the context of the automatic inspection system design problem. The design methodology for the inspection system, as proposed in block diagram form, is based on the solutions to these three …
Evaluation Of Shortage Costs - Part Ii: Loss Of Goodwill - Application Of Semi-Markov Processes, Muhittin Oral, S. Subba Rao
Evaluation Of Shortage Costs - Part Ii: Loss Of Goodwill - Application Of Semi-Markov Processes, Muhittin Oral, S. Subba Rao
Research Reports from the Department of Operations
In a previous report (Technical Memoranda No. 248) we formulated the problem of evaluating inventory shortage costs from a new perspective. In a single cycle which consisted of a no-stock out and a stock-out period, we identified and evaluated immediate shortage costs using results from queuing theory. A second part of the shortage costs is due to loss of customer goodwill and this has to be considered over a number of cycles. In the present report, we propose a method of evaluating the loss of customer goodwill. We show that the (Q,S,R) policy gives rise to a (R+S+2) - state …
Analysis Of The Reserve Book System At The Health Center Library, Keki R. Dadachanji, Phiroz P. Darukhanavala, Shailesh J. Mehta, Pradip H. Shroff
Analysis Of The Reserve Book System At The Health Center Library, Keki R. Dadachanji, Phiroz P. Darukhanavala, Shailesh J. Mehta, Pradip H. Shroff
Research Reports from the Department of Operations
This study examines the Reserve Book System at the Health Center Library, part of the Cleveland Health Sciences Library. Initiated by a survey highlighting congestion at the Circulation desk, the study evaluates the current Reserve book policy and proposes improvements. Using Operations Research techniques, including the DELPHI method and computer simulation, the team developed a Scoring Model to assess alternative policies. Key recommendations include optimizing the number of reserve copies, reducing the number of books on reserve, and maintaining a single server at the Circulation desk. The study emphasizes the practical application of these models for future policy evaluation and …
Analysis And Forecasting Of Anesthesia Manpower In Cuyahoga County, Ohio, J. S. Gravenstein, Augustine O. Esogbue, Arnold Reisman, Burton V. Dean, Vijaykumar V. Aggarwal, Vasant B. Kaujalgi, Peter M. Lewy
Analysis And Forecasting Of Anesthesia Manpower In Cuyahoga County, Ohio, J. S. Gravenstein, Augustine O. Esogbue, Arnold Reisman, Burton V. Dean, Vijaykumar V. Aggarwal, Vasant B. Kaujalgi, Peter M. Lewy
Research Reports from the Department of Operations
This report discusses the major aspects of a recent study which was concerned with the supply and demand projections for anesthesia manpower in Cuyahoga County in Ohio for a ten year planning horizon (1970-1980); the identification of the constraints which contribute to the gap between current and 'ideal' manpower levels of anesthesiology; the development of an approach to the recruitment and training of anesthesiology manpower and the generation of information which would be useful in developing approaches to the improvement of anesthesia manpower utilization. The latter aspect of the study extends a previous effort by the authors which employed an …
Integer Programming : Partitioning In Mixed Integer Programming, Harvey M. Salkin
Integer Programming : Partitioning In Mixed Integer Programming, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the tenth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.
Binding Inequalities In Benders' Partitioning Algorithm, Harvey M. Salkin
Binding Inequalities In Benders' Partitioning Algorithm, Harvey M. Salkin
Research Reports from the Department of Operations
The mixed integer program is transformed to its equivalent integer program which has a vast number of "z inequality" constraints. A brief description of Benders' partitioning algorithm for the mixed integer program, which is suggested by the transformation, is then given. It is shown that unless a bounding constraint is explicitly introduced, a z inequality (hyperplane) that does not intersect an optimal solution to the integer program which appears in the algorithm cannot be dropped. Furthermore, if the bounding constraint is used in place of keeping not binding inequalities, the algorithm may converge at a slower rate. A small plant …
On The Linear Complementarity Problem, Arza K. Rao
On The Linear Complementarity Problem, Arza K. Rao
Research Reports from the Department of Operations
Consider the linear complementarity problem given by system (1): w = Mx + q (1) w ≥ 0, x ≥ 0 (2) } (I) x'w = 0 (3) where w, x and q are vectors of dimension n and M is a matrix of order n x n. Any (x,w) satisfying conditions (1) and (2) is a feasible solution to system (1). Any (x,w) satisfying (1), (2) and (3) is a complementary feasible solution to system (1). The main results derived in this work are given below. 1) Let MZ - class (i.e. off diagonal elements non-positive). Then Lemke's algorithm …
A Solution To A Special Class Of Flow Shop Scheduling Problems, Michael S. Salvador
A Solution To A Special Class Of Flow Shop Scheduling Problems, Michael S. Salvador
Research Reports from the Department of Operations
This research considers the most general type of "network" flow shop in which jobs pass through each of m > 2 stages, where the ith stage is composed of ni ≥ 1 identical processors. Jobs are processed on one processor at each stage in ascending order of stage numbers and the objective is minimization of makespan. The class of shops considered includes those where in-process inventory is prohibited and the sequence of jobs processed on a particular processor is required to be a subsequence of the jobs entering the shop; without these additional constraints, algorithmic solutions are available only for the …
Use Of A Decision Box/Pert Network For Predicting Probabilities And Time Durations, Edward M. Norin
Use Of A Decision Box/Pert Network For Predicting Probabilities And Time Durations, Edward M. Norin
Research Reports from the Department of Operations
It was desired to estimate the time required and probability of success in the development of a new biocide, DS. Since many alternate paths would be considered but not developed, the normal deterministic activity networks—such as CPM or PERT—could not handle this problem. Instead, an extended decision box network coupled with PERT was used to create an algorithm with two degrees of freedom: probability of success and time distribution. The results of the algorithm indicate a 96% probability that at least one path to commercial DS will be developed. The expected time for development is 111 workdays, with a 90% …
A Multi-Library System Distribution Network Design, M.G. Fancher Beeler, J.P. Herling, Arnold Reisman, Burton V. Dean
A Multi-Library System Distribution Network Design, M.G. Fancher Beeler, J.P. Herling, Arnold Reisman, Burton V. Dean
Research Reports from the Department of Operations
At the time of this study, the chief burden for physical transportation of library materials in the Greater Cleveland (Ohio) area rested with the independently operating and overlapping services of the Cleveland Public Library (CPL) and Cuyahoga County Public Library (CCPL). Library materials, however, are shipped to and from the various branches of several independent suburban library systems; school libraries of over thirty Boards of Education; several universities and numerous "special" public and private libraries. In all, the network includes over 700 nodes. The direct cost of the two major transportation systems, e.g., CPL and CCPL, exceeds $150,000 a year. …
Integer Programming : Search Enumeration, Harvey M. Salkin
Integer Programming : Search Enumeration, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the ninth chapter of a forthcoming book “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.
Inventory Cost Parameters, Muhittin Oral
Inventory Cost Parameters, Muhittin Oral
Research Reports from the Department of Operations
The work in this research falls in the area of operations research known as inventory theory, concentrating on inventory cost parameters (or functions) in general and on the development of a model to evaluate shortage cost in particular. The inventory policy (Q,S,R) with constant lead time L is introduced, where Q is the constant size of orders, S the reorder level and R is the upper limit for the backlogged demand. Associated with the (Q,S,R) policy a (R+S+2)-state semi-Markov process is defined the states corresponding to no-stockout durations starting initially with various levels of physical inventory and to stockout duration …
Evaluation Of Shortage Costs - Part I An Objective Function And Queueing Theoretic Approach, Muhittin Oral, S. Subba Rao
Evaluation Of Shortage Costs - Part I An Objective Function And Queueing Theoretic Approach, Muhittin Oral, S. Subba Rao
Research Reports from the Department of Operations
Most of the objective functions of inventory control models have cost parameters, namely, set-up or order cost, inventory carrying cost, and shortage cost. Successful implementation of inventory models requires an accurate evaluation of these cost parameters. Of these costs, shortage costs are the hardest to handle. This paper investigates and derives a model to evaluate shortage cost parameters utilizing a queueing-theoretic approach. The basic idea is to identify the measurable factors of shortage cost for which the associated costs are much simpler to obtain. The shortage cost can then be expressed in terms of these component costs. When inventory level …
A Social Service Measurement Model, Samuel J. Mantel, Jr., Allan L. Service, Arnold Reisman, Raymond A. Koleski, Arthur Blum, Robert Reich, Burton V. Dean, Miriam Jaffee, Howard Reiger, Richard Ronis, Judah Rubenstein
A Social Service Measurement Model, Samuel J. Mantel, Jr., Allan L. Service, Arnold Reisman, Raymond A. Koleski, Arthur Blum, Robert Reich, Burton V. Dean, Miriam Jaffee, Howard Reiger, Richard Ronis, Judah Rubenstein
Research Reports from the Department of Operations
The development and implementation of a measurement model for a system of social service agenci.es is discussed. The system, the Jewish Community Federation of Cleveland, is a voluntary association of a full range of human service agencies. Design and workings of the project team, analysis and structuring of the organizational system, and overall goals of the research are first presented. The measurement model itself is then delineated. Essentially, the model is a device for assembling and synthesizing information on system throughput, priorities, and indicators of "quality" of service. Finally, the information system which supports the model is examined and other …
Note On Finite Convergence Of Exterior Penalty Functions, Klaus Truemper
Note On Finite Convergence Of Exterior Penalty Functions, Klaus Truemper
Research Reports from the Department of Operations
It is shown that existence of a saddlepoint of the Lagrangian function in an optimization problem is sufficient to assure finite convergence of a special exterior penalty function. Also, an estimate of the penalty weight is given that yields finite e-convergence for the quadratic exterior penalty function. [Likely published circa 1972.]
Integer Programming : Branch And Bound Enumeration (Land And Doig [16], 1960), Harvey M. Salkin
Integer Programming : Branch And Bound Enumeration (Land And Doig [16], 1960), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the eighth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.