Open Access. Powered by Scholars. Published by Universities.®
Business Administration, Management, and Operations Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Operations research (644)
- Mathematical optimization (144)
- Algorithms (106)
- Stochastic processes (73)
- Decision making--Mathematical models (71)
-
- Linear programming (71)
- Integer programming (42)
- Queuing theory (38)
- Research and development projects (35)
- Markov processes (34)
- Dynamic programming (33)
- Production scheduling (30)
- Mathematical models (28)
- Resource allocation (28)
- Nonlinear programming (23)
- Branch and bound algorithms (22)
- Computational complexity (22)
- Flexible manufacturing systems (22)
- Inventory control (22)
- Simulation methods (22)
- Computer simulation (21)
- Industrial management (21)
- Manpower planning (19)
- Programming (Mathematics) (19)
- Queueing theory (17)
- Delphi method (16)
- Dental offices--Management (16)
- Heuristic algorithms (16)
- Inventory control--Mathematical models (16)
- Production management (16)
- Publication Year
Articles 361 - 390 of 645
Full-Text Articles in Business Administration, Management, and Operations
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.]
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.