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 931 - 960 of 1238
Full-Text Articles in Business
A National Planning Model For Higher Education, Vaughn E. Huckfeldt
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 …
Some Results For Hyper-Exponential And Hyper-Poisson Queues, Shailesh J. Mehta, S. Subba Rao
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.
Computational Experience With An Enumerative Algorithm For The Set Covering Problem With Base Constraints, Harvey M. Salkin, Chien-Hua Lin
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 …
Row Generalized Linear Programs, R. Chandrasekaran
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.
The Complementarity Problem Of Mathematical Programming, Arie Tamir
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 …
Gochurch : A Simulation Model For Forecasting Church Growth, John J. Rasmussen
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 …
Optimal Flows In Networks With Positive Gains, Klaus Truemper
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.
One Machine Sequencing To Minimize Mean Flow Time With Minimum Number Tardy, Hamilton Emmons
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.
Some Approximate Results For A Heavily Loaded Single Server Queue With Semi-Markovian Services, S. Subba Rao
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.
Integer Programming : Branch And Bound Enumeration (Land And Doig [17]), Harvey M. Salkin
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.
All-Integer Integer Programming Algorithms Applied To Tableaux With Rational Coefficients, Harvey M. Salkin, Shailesh J. Mehta, Pradip H. Shroff
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.
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
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 …
Service Time Partitioning To Minimize Mean Flow Time, R. Chandrasekaran, Hamilton Emmons, S. Subba Rao
Service Time Partitioning To Minimize Mean Flow Time, R. Chandrasekaran, Hamilton Emmons, S. Subba Rao
Research Reports from the Department of Operations
This study investigates strategies for managing variable patient arrival rates in hospital outpatient clinics, particularly during peak times when waiting rooms overflow. A potential solution, inspired by scheduling theory, is partitioning patients by service time, with a focus on minimizing mean flow time (the total wait and service time). Using a stochastic scheduling model, the study explores a "quick service counter" approach where customers with shorter processing times are served by dedicated servers, preserving seniority to ensure fairness. Service times are assumed observable in advance, as in scenarios like supermarket checkout or preliminary hospital screening. The model simplifies complex queueing …
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 and published by Addison-Wesley. The cutting plane algorithm for the mixed integer program, developed by Ralph Gomory in 1960 and presented in this chapter, is a direct extension of the integer programming algorithm discussed in Chapter 3. Again, the intent is to whittle the feasible region down to one whose optimal vertex has integer values for the integer-constrained variables. As before, the cutting plane technique utilizes the dual simplex method and allows fractional numbers in computation and is thus classified as …
Integer Programming : The Fixed Charge Problem The Plant Location Problem, Harvey M. Salkin
Integer Programming : The Fixed Charge Problem The Plant Location Problem, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the fourteenth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley. Contents: Algorithms: A branch and bound algorithm for the fixed charge problem; a branch and bound algorithm for the plant location problem.
Heavy Traffic Analysis For Discrete Time Queues, S. Subba Rao
Heavy Traffic Analysis For Discrete Time Queues, S. Subba Rao
Research Reports from the Department of Operations
We say that a queue is in heavy traffic if the traffic intensity p is very close to unity. Heavy traffic studies of M/G/1 and G/G/1 are fairly well known when the arrival and service time distributions are continuous. The behavior of discrete time queues in heavy traffic which seems to have not been treated earlier, is the subject of this report.
Improved Delivery Of Library Materials: The Cleveland Experience, J.P. Herling, M.G. Fancher Beeler, Arnold Reisman, Burton V. Dean
Improved Delivery Of Library Materials: The Cleveland Experience, J.P. Herling, M.G. Fancher Beeler, Arnold Reisman, Burton V. Dean
Research Reports from the Department of Operations
This paper describes a project designed to improve services to library users by solving, through the application of operations research methods, a complex problem of delivery of library materials in an urban, multi-system library service region. Unique features, methodology, results and limitations are discussed in non-technical language.
Integer Programming : Dual Fractional Integer Programming (Gomory [10]), Harvey M. Salkin
Integer Programming : Dual Fractional Integer Programming (Gomory [10]), 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 and published by Addison-Wesley. 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.
Integer Programming : Primal All-Integer Programming (Glover [6], Young [12]), Harvey M. Salkin
Integer Programming : Primal All-Integer Programming (Glover [6], Young [12]), 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 and published by Addison-Wesley.
Integer Programming : Dual All-Integer Integer Programming (Gomory [5]), Harvey M. Salkin
Integer Programming : Dual All-Integer Integer Programming (Gomory [5]), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the fifth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley. 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 to the maintenance of lexicographic positive columns in the tableau. 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 …
Obstetrical Anesthesia Manpower Planning Study Progress Report I, Arnold Reisman, C. Redderson, Burton V. Dean, Hamilton Emmons, J. S. Gravenstein, M. Stern, M. Lin, Shailesh J. Mehta, John J. Rasmussen, K. Wright
Obstetrical Anesthesia Manpower Planning Study Progress Report I, Arnold Reisman, C. Redderson, Burton V. Dean, Hamilton Emmons, J. S. Gravenstein, M. Stern, M. Lin, Shailesh J. Mehta, John J. Rasmussen, K. Wright
Research Reports from the Department of Operations
This report discusses the progress to date of the initial phase of the obstetrical anesthesia manpower planning study in Cuyahoga County, Ohio, being performed under the sponsorship of the Maternal and Child Health Service, Health Services and Mental Health Administration, Department of Health, Education and Welfare. This study is organized into five major sections. First, the organization of the problem and of the research team is described, the steps employed during this phase to achieve the project's objectives are listed, the scope of the information base is defined, and the relevant literature is discussed. Second, definitions of the types of …
Integer Programming : The Set Covering Problem The Set Partitioning Problem, Harvey M. Salkin
Integer Programming : The Set Covering Problem The Set Partitioning Problem, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents chapter 13 of a forthcoming book entitled “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.
New Tools For Decision Making, Arnold Reisman, Robert Reich
New Tools For Decision Making, Arnold Reisman, Robert Reich
Research Reports from the Department of Operations
The complex nature of certain problems encountered in industry, government, and private institutions has produced a demand for procedures to aid management in improving the decision-making process. These procedures should weigh the relative trade-offs between alternatives and produce a course of action that will benefit the organization as a whole and not simply a unit thereof at the possible expense of other units. The development, during the last quarter of a century, of certain mathematical and/or statistical techniques along with the computational and data bank capabilities of present-day computers has further demonstrated the applicability of "NEW TOOLS FOR DECISION MAKING" …
Integer Programming : The Knapsack Problem (Including : The Capital Budgeting Problem The Cutting Stock Problem), Harvey M. Salkin
Integer Programming : The Knapsack Problem (Including : The Capital Budgeting Problem The Cutting Stock Problem), Harvey M. Salkin
Research Reports from the Department of Operations
This work represents chapter 12 of a forthcoming textbook entitled “Integer Programming” to be written by Harvey M. Salkin.
S.I.M.O.N. : Stochastic Inventory Model Of Newsboy, Ronald E. Mitchell, Jr.
S.I.M.O.N. : Stochastic Inventory Model Of Newsboy, Ronald E. Mitchell, Jr.
Research Reports from the Department of Operations
This paper examines a stochastic inventory model, commonly referred to as the "newsboy problem," which addresses inventory management for perishable or short-lived goods. The model considers several key characteristics, including single-unit purchases and sales, instantaneous order receipt, short product lifespan, the inability to fulfill late orders, and fixed holding and setup costs irrespective of quantity. Salvaging unsold goods at the end of the period is also a factor. The paper presents single-period, two-period, and multiperiod models, each accompanied by examples and guidance on leveraging a computer program for calculations. The proposed system, SIMON (Stochastic Inventory Model of Newsboy), provides computational …
Strategies For Implementing Systems Studies, Arnold Reisman, Cornelis A. De Kluyver
Strategies For Implementing Systems Studies, Arnold Reisman, Cornelis A. De Kluyver
Research Reports from the Department of Operations
This paper explores the philosophical foundations and critical factors underlying the successful implementation of systems studies. It emphasizes that the likelihood of success increases when careful attention is given to implementation requirements across all phases, from inception to completion. Key factors identified include the relationship between client and sponsor, organizational settings, task force structure, planning for implementation, communication of methodology and results, and technical aspects such as data collection and evaluation. The paper highlights the importance of transferring study ownership to management and engaging them throughout the process to ensure understanding and acceptance. A framework is proposed to assess and …
Integer Programming : Group Theory In Integer Programming, Harvey M. Salkin
Integer Programming : Group Theory In Integer Programming, Harvey M. Salkin
Research Reports from the Department of Operations
This work represents the eleventh chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley.
A Measurement Model For Planning And Budgeting For The Jewish Community Federation Of Cleveland, Allan L. Service, Arnold Reisman
A Measurement Model For Planning And Budgeting For The Jewish Community Federation Of Cleveland, Allan L. Service, Arnold Reisman
Research Reports from the Department of Operations
This report presents the findings of a three-year study applying operations research and systems analysis techniques to the planning and budgeting challenges faced by the Jewish Community Federation of Cleveland. The introductory chapter outlines the research context, historical background, and key personnel involved. Subsequent chapters detail the development of a conceptual model that defines system goals and establishes performance indicators for the Federation's agencies. A supporting information system for collecting service statistics is discussed, including subjective sampling methods when objective data is unavailable. The report further explores information processing procedures and the presentation of output data. Finally, the study evaluates …
Order-Preserving Allocation Of Jobs To Two Machines, Shailesh J. Mehta, R. Chandrasekaran, Hamilton Emmons
Order-Preserving Allocation Of Jobs To Two Machines, Shailesh J. Mehta, R. Chandrasekaran, Hamilton Emmons
Research Reports from the Department of Operations
In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed.
The Evaluation Of Outputs Of Health, Education And/Or Welfare Programs In Local Agencies, Arnold Reisman
The Evaluation Of Outputs Of Health, Education And/Or Welfare Programs In Local Agencies, Arnold Reisman
Research Reports from the Department of Operations
The scope of Industrial Engineering has expanded from measurement of and design of manual work in industrial settings to man-machine interactions and on to man-man interactions in processes which are both within and external to industrial sectors. This paper discusses the methods used in evaluation of outputs of highly professional services offered in disparate agencies, both public and private, serving health, education, and/or welfare needs of clients in the Cleveland, Ohio area as well as uses of such evaluations in program evaluation and resource allocation. [Publsihed circa 1973-1974.]