Business Administration, Management, and Operations Commons^™

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.

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 …

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

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

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

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

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

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

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 …

No. 81 1973 April

International Journal for Business Education

SIEC Historical Documents

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.

Gambler's Ruin Model As An Aid In Capital Budgeting Decisions, James A. Knoblett

Management Adviser

No abstract provided.

Management Advisory Services Forum, William E. Arnstein, Philip L. Blumenthal, Roy A. Lindberg, Arthur B. Toan Jr., H. G. Trentin, Allen Weiss

Management Adviser

No abstract provided.

Practical Marketing Model For Short- And Long-Range Planning, Frank Schultz

Management Adviser

No abstract provided.

Improving Financial Information Systems For University Management, William L. Kendig, Robert A. Levy

Management Adviser

No abstract provided.

New Frontier For Consultants?, Louise H. Dratler

Management Adviser

No abstract provided.

What People Are Writing About, Wesley E. Flanagan, Terry E. London, Philip L. Kintzele, James H. Scheiner, William Robert Smith

Management Adviser

No abstract provided.

Users: A Computer Program For Voluntary Social Agencies, Thomas L. Bransford

Management Adviser

No abstract provided.

Management Adviser, Volume 10, Number 2, March-April 1973 (Whole Issue), American Institute Of Certified Public Accountants

Management Adviser

No abstract provided.

Managing A Racetrack The Modern Way, Howard J. Oboler

Management Adviser

No abstract provided.

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

Management Adviser

No abstract provided.