Business Commons^™

Roles Of Systems Specialists, Harvey H. Shore

Management Adviser

No abstract provided.

What People Are Writing About, G. Richard Chesley, Grover L. Porter

Management Adviser

No abstract provided.

Managment Adviser, Volume 10, Number 4, July-August 1973 (Whole Issue), American Institute Of Certified Public Accountants

Management Adviser

No abstract provided.

Cash Management: Forecasting For Profit, Paul J. Beehler

Management Adviser

No abstract provided.

Aiding The Flow Of Sales Order Documents Through Machine-Scheduling, Lane K. Anderson

Management Adviser

No abstract provided.

Manufacturing Communications In A Small, Multi-Plant Company, Fred D. Bauce

Management Adviser

No abstract provided.

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

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

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

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

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.

1973-05-12, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

Key-Result Approach To Designing Management Information Systems, Heinz A. Burgstaller, John D. Forsyth

Management Adviser

No abstract provided.

People, Events, Techniques, American Institute Of Certified Public Accountants

Management Adviser

No abstract provided.

Three Ways To Wake Up Procedures Manuals, William N. Mcnairn

Management Adviser

No abstract provided.

Computer-Assisted Planning In The Public Sector, Robert A. Nielsen, Vincent R. Locascio

Management Adviser

No abstract provided.

What People Are Writing About, James M. Krueger, Kenneth Rosenzweig, William S. Hawthorne

Management Adviser

No abstract provided.

Management Adviser, Volume 10, Number 3, May-June 1973 (Whole Issue), American Institute Of Certified Public Accountants

Management Adviser

No abstract provided.

Accounting Geared To Physical Distribution's Third Generation, Ronald J. Lewis

Management Adviser

No abstract provided.

Sample Of Statistics, Brian P. Boas

Management Adviser

No abstract provided.

An Investigation To Identify Management Topics To Be Included In The Business Administration Program At Utah State University, Richard E. Zackrison

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

The development of management techniques which are in keeping with the changing environment has been termed "management science." Thrall points out that "management science has not yet reached a stage in which standardization or freezing of educational programs is desirable. " Further, he states that "we should explore new educational ideas, keeping in mind that many management scientists will become managers."

Management science may be in the rut described by Gordon and Howell. They assert that those businessmen and educators who fail to keep pace with change are forced to "plod in a rut they dug long ago. For them …

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

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

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.

Operations Research Model For Competitive Bidding, Harold Kerzner

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this paper is to demonstrate a model for competitive bidding. The model is based upon a thorough knowledge of the competitors. The model is designed to optimize a solution, given the desired profit and the minimum probability of success. Various cases are considered showing how the quantitative and qualitative nature of the competitors' bidding history may influence the final optimized solution.

In order to optimize a solution, a reduction in total manhours is usually needed. The reduction in manhours increases the risk of a cost overrun upon job completion. The magnitude of the risk, as well as …

1973-04-04, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

Development Of A Job Evaluation System At The American University In Cairo (A Case Study), Fayek Gaballa Hanna

Archived Theses and Dissertations

No abstract provided.

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

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

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 …