bluuebunny/crossref_metadata_2025 huggingface dataset:
Even-Flow, A Scheduling Method for Reducing Lateness in Job Shops
Authors: Ackerman Sanford S.
Published: November 2008

The development of the Even-Flow system was initiated by Mr. Gregory M. Boni, who observed that the elapsed time to complete a job in job shops was often a function of the number of operations performed rather than the time spent actually performing the operations, and that the time between operations was relatively constant. When this is true, the job shop can be thought of as an assembly line in which the machines are the stations, and the work to be done at each station consists of all of the operations which must be performed if the jobs are to flow evenly from machine to machine through the shop.

The existence of a predictable time between the successive operations of each job gives one the ability to schedule the completion of parts at desired due-dates with reasonable assurance. This ability is crucial in the production of parts for assembly lines; the shortage of one part could result in shut-down of the line or expensive out-of-station work. The Even-Flow system described below is an attempt to maximize the number of on-time completions by integrating the scheduling, loading, and dispatching functions in a manner which capitalizes on the “natural” movement of work through the shop. The simulation of this system in comparison with other scheduling rules, described below, was conducted by Professors Conway and Maxwell on the Cornell University Simulator, a program written for the IBM-650.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Toward a Universally Viable Philosophy of Management
Authors: Ericson Richard F.
Published: November 2008

Management, itself, has come to accept, to an increasing extent, a new definition of its functions. Perhaps, in this evolution is to be found the hope of the future, based upon managerial acceptance of new concepts, new interpretations, and rejection of some old concepts—economic, political, sociological, and ethical. (Epigraph by George Fillipetti, Industrial Management in Transition, p. 328.)

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
An Evaluation of a Decision Simulation as a Learning Environment
Authors: McKenney James L.
Published: November 2008

This paper presents the conclusions of a series of experiments to evaluate the use of a decision simulation game in a graduate business school curriculum. A brief description of the simulation model is followed by a discussion of how the game was first utilized. The first formal evaluation experiment and conclusions are then presented. The second and third decision simulation game sessions are then described to illustrate the evolution of curriculum design which includes a simulation decision game. The next section deals with the experiments planned to evaluate these game sessions. The final part presents the overall conclusions and describes the decision simulation game to be utilized in 1963.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Industrial Dynamics and the Design of Management Control Systems
Authors: Roberts Edward B.
Published: November 2008

The usual approaches to management control system design often fail to be effective, sometimes creating problems more significant that those they resolve. Such failures result from lack of total system understanding, from use of subsystem constraints, and from inadequate or improper treatment of the human decision-making elements of the system. Examples drawn from Industrial Dynamics research studies illustrate these problems and provide some pointers for remedying the difficulties.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Reducing Fixed and Variable Costs of Distribution
Authors: Hammond Robert A.
Published: November 2008

This article describes a problem in which most of the warehouses in a distribution system were owned by the Company and a significant reduction in the number of warehouses was being considered. A model of the distribution system was used to determine, through a series of approximations, a system in which total costs—including the fixed costs—were minimized by eliminating the most costly warehouses and changing the locations and sizes of others. The development of the model and the interpretation of the results in terms of management action are discussed.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
An Application of the Critical Path Method to Job Shop Scheduling—A Case Study
Authors: Heuser William A. , Wynne B. E.
Published: November 2008

Small and medium-sized job shops are often run with little or no production scheduling. As the number and complexity of jobs increases, management finds it increasingly difficult to control costs and still maintain delivery dates. In order to provide management with the needed control, some practical scheduling system is needed. This case study describes the installation, in a medium-sized tool shop, of such a system based on CPM and operated manually. Emphasis is placed on the problems of converting CPM into a continuing, working system under the manual operation of shop scheduling personnel. Much of the value of CPM in the final system is its use as a “one-shot” analytical tool to aid in the production of a shop schedule. An unusual feature of the system is that it provides a method for the routine scheduling of two critical manpower resources in a multiple-network situation.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
A Management Control Systems Simulation Model
Authors: Kagdis John , Lackner Michael R.
Published: November 2008

This paper describes a digital simulation model of a hypothetical business system and discusses problems pertinent to the construction and use of the model. Constructed in the course of a management control systems research project, the model exemplifies many problems of control and management of a large system, emphasizing information flow, its control, and its use in decision procedures. The model's modular nature permits a variety of experimental uses.

The broad scope of the modeled system posed implementation problems which were resolved by the development of a general simulation capability, called SIMPAC, whose main features are described.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Simulation as an Aid to Staffing a Customer Service Function
Authors: Hespos Richard F.
Published: November 2008

This paper describes the use of simulation to solve a variation of the repairman problem too complex to be handled by analytical means. It describes the operation of a model simulating a service activity and the use of the model to provide data for management decisions.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
GREMEX—A Research and Development Management Simulation Exercise
Authors: Malcolm D. G. , Hibbs J. R. , Taul J. W. , Vaccaro M. J.
Published: November 2008

In planning and managing one of today's scientific development programs, the project manager must chart a course of action from seemingly innumerable alternatives. In addition to the quantity of decisions, his planning and management tasks are usually further complicated by a required compression of the time schedule for the project and by the knowledge that Performance, Cost and Time estimates, from which he must base his decisions, are biased and have an unknown amount of uncertainty built into them.

Research and development management today attempts to give overall direction to its research resources applied to the programs, projects, and the systems making up each project, by requiring evidence of a concurrent, coordinated plan for achieving technical, cost and time objectives. Once such a plan is established and approved—a plan in which a high degree of interdependence and uncertainty exists—a requirement for a project team that is capable of literally “creating on schedule” has in effect been established.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Universal Education for the Management Sciences
Authors: Hertz David B.
Published: November 2008

As we move toward more complex ways of controlling production and distribution of a greater variety of goods and services through ever more complicated technology, it is perhaps natural that some should entertain the illusion that automation will ultimately take the place of human effort in supplying our needs. We hear daily that this or that management group will soon be replaced by the computer.

But in truth, the evidence is that the need for managers is greater than ever and that the supply lags ever further—in quality and quantity—behind the still growing demand. As John Fischer puts it in Harper's Magazine (4): “Our inability to locate enough first rate management talent in many fields—from college president to corporate controller, from regional planner to operations analyst—may yet prove to be the breakdown point in our civilization.”

In this paper I wish to advance the idea that universal education in management sciences is as urgent—perhaps even more urgent—a need as education in the physical and biological sciences.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Maximization in the Oil Industry—A Survey
Authors: Foster B. L.
Published: November 2008

Applications to oil industry problems of several mathematical techniques related to maximization or minimization are surveyed. In addition to providing an extensive, although not exhaustive, coverage of the relevant papers and books, the report may serve as an elementary introduction to the topics involved. To further this goal, simple illustrations of the central ideas are given. These include new examples as well as simplified versions of old ones. Finally, an attempt is made to evaluate the limitations and potential utility of some of the techniques.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
A Dynamic Model for the Optimal Loading of Linear Multi-Operation Shops
Authors: Elmaghraby Salah E. , Ginsberg Allen S.
Published: November 2008

Because of the stochastic nature of the parameters in the general job shop problem (e.g., estimates of processing times; estimates of delay times; the sequence of operations; the availability of processing units; etc.), Monte Carlo simulation has been the principal tool of analysis. In particular, a large proportion of studies was focused on the indirect control of the functions of scheduling and loading by the device of assigning priorities to the various jobs in the shop.

In this paper, we depart from this tradition for two good reasons. First, the linear characteristic of flow eliminates an important disrupting factor present in the general problem treated by the other authors. Second, priority decision rules are perhaps the last sphere of decision open to managers and may have a very limited effect since they are seriously constrained by previously-made decisions. In fact, priority decisions, coming as they do at the “tail” of the decision process, may prove ineffectual in the face of previously-established sales quantities, promised due dates, capacity limitations, etc. Consequently, a study of the “higher echelon” decisions of scheduling and loading is necessitated.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Measuring Cost Parameters in Inventory Models
Authors: Bock Robert H.
Published: November 2008

Inventory control models have received a great deal of attention in recent years. But the fruitful application of inventory models is limited by the correct determination of cost parameters, and this area has not received as much attention. The purpose of this paper is to explain how the cost parameters of inventory models can be correctly estimated, and to reveal some commonly accepted errors.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
A Quasi-Analytic Approach to the Business Strategy Problem
Authors: Ansoff H. I.
Published: November 2008

Some fifteen years ago the RAND Corporation first attempted to broaden its field of interest to include the policy and strategy formulation in the military establishment. The initial reaction of the responsible officers in the Pentagon was that the nature of the military policy problem was quite different from weapons systems analysis and selection in which RAND specialized and that the tools used in the latter simply did not carry over into the policy area. Techniques and concepts of weapons systems optimization did not apply to the esoteric area of strategic planning. Strategy was an art, not a science, and was going to remain so.

Time has proved this reaction to be only partially right. It is true that analysis of strategy requires additional concepts and methodologies which differ in some significant respects from the operations research techniques used in systems analysis. On the other hand, very substantial progress has been made in analytic studies of military strategy formulation.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
The Influence of Department of Defense Practices on Corporate Planning
Authors: Smalter Donald J.
Published: November 2008

Over the past several years I've conducted a personal study of Department of Defense practices and activities.

My company has no business whatsoever with the Department of Defense, so my interest related strictly to the observation of D-O-D methodologies, their analytical techniques and the usefulness of these to the management of large corporations. In particular, this question puzzled me: Why were many observers labeling Robert McNamara a “great” manager?

I found this: There are many significant “values” in observing the D-O-D, as their managerial problems are bigger and more complex. They must, of necessity, formalize and systematize many more of their practices and procedures than managers in smaller organizations.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
International Corporate Planning: How Is It Different?
Authors: Pryor Millard H.
Published: November 2008

Within the last decade, a large number of American firms have formalized their objectives, and have begun to plan the long-range programs necessary to meet corporate goals. As international operations have assumed more importance within the overall scope of these firms' activities, many companies have begun to apply their experience in domestic planning to operations outside the United States. However, just as pediatricians have convinced us that there is more to healing children than treating them as little adults, the blanket application of domestic planning approaches and techniques is not only inadvisable, but unfeasible. I would like to spend my time with you this afternoon considering how international long-range planning is different, and attempt to determine within the context of my own company's experience, how domestic planning concepts must be modified in an international environment.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
The Interrelation Between Planning and Acquisition
Authors: Ricciardi Franc M.
Published: November 2008

An essay that examines the specific vocabulary used in planning of mergers and acquisitions of companies.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Marketing Planning Panel
Authors: Weaver Paul E. , Gunther Edward P. , Learner David B.
Published: November 2008

Condensed transcripts of the Marketing Planning Panel of the TIMS College of Planning, Moderator was Paul E. Weaver; panelists were Edward P. Gunther and David B. Learner.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Introduction
Authors: Warren E. Kirby
Published: November 2008

Introduction to the focused issue devoted to the 1964 Annual Symposium of the College on Planning.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Planning, Anticipating and Managing
Authors: Smiddy Harold F.
Published: November 2008

In the perhaps naive belief that a keynoter has some responsibility to live up to his program billing—in this situation the aim to explore “newer and somewhat more advanced ideas” about corporate planning—I wish to place a definitely radical proposition before TIMS members at this time.

The proposition is that the work of many of the most devoted and vocal “corporate planners” rests today on a fundamentally false bottom—namely, an assumption that our current large corporate entities represent a “highly developed” stage in the evolution of business enterprises. I suspect our successors, with 20/20 hindsight, will wonder how we ever missed sensing that—measured against the potentials inherent in them—our modern corporations constitute the most challenging underdeveloped communities of our complex modern World.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Inner-Directedness in Planning
Authors: Grossman Adrian J.
Published: November 2008

It is the purpose of this paper to present arguments and evidence supporting the thesis that:

—Redefining business data is a valuable addition—indeed, is central—to business planning; and

—In many businesses, to do so, requires “inner-directedness” in the planning effort.

Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
On Bus Schedules
Authors: Foulkes J. D. , Prager W. , Warner W. H.
Published: November 2008

The equations used in the examples were formulated with the aid of a spiral diagram which represents the result of preliminary scheduling in so far as it assigns each bus to a definite route and indicates how the various branches are geared together. In complicated networks the construction of a suitable spiral diagram may itself become a difficult problem, particularly when the buses flowing into a main branch have to be geared with the buses flowing out of this branch. The following procedure has been found useful in this case. Of the possible arrangements of the buses flowing into and out of the main branch, select the two which present the most symmetric appearance; perform the minimizing calculation on the various ways of fitting these patterns together. The optimum schedule is likely to be one of these combinations.
The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
Authors: Charnes A. , Cooper W. W.
Published: November 2008

Recent scientific research has made available a variety of tools which can be brought to bear on managerial problems. One of these tools, which has already proved its worth in practical applications, is linear programming. It is not the purpose of this article to explore the full ramifications of these research developments or even to explore the general field of linear programming. Only transportation-type problems and models will be discussed in any detail.
Smooth Patterns of Production
Authors: Hoffman A. J. , Jacobs Walter
Published: November 2008

A number of authors have considered mathematical models for scheduling rates of production to meet a projected series of requirements. In particular, linear models have been used in several studies. This paper considers a simple model of that type, which explicitly allows for inventory costs.
Survey of Research on Mathematical Solutions of Programming Problems
Authors: Orden Alex
Published: November 2008

My topic in this panel discussion on management science today is the status of research on mathematical solution of programming problems. The word “programming” refers here to optimal allocation, as in machine loading, or to optimal scheduling of one kind or another. “Optimal allocation” may be taken as referring to static problems, while “optimal scheduling” refers to dynamic problems, varying over time. The static and dynamic problems are, at the present stage of management science development, generally speaking, studied by means of the same techniques.
Towards an Integrated Framework of Data Analysis
Authors: Glaser Ezra
Published: November 2008

Essay delivered, as a symposium paper on “Management Science Tomorrow,” before the first national meeting of the Institute of Management Sciences, Oct. 21–22, 1954.
Behavioral Management Science
Authors: Hayes Samuel P.
Published: November 2008

In the management science of tomorrow, I predict, there will be a great growth of these and other techniques whereby practitioners and scientists will inform, stimulate and influence each other. One of the most fruitful functions of this new Institute, in my opinion, would be to put some of its intellect and energy into developing such techniques. One of the most important management sciences of tomorrow could well be the science that joins management science and management.
Future of Mathematics in Management Science
Authors: Charnes A.
Published: November 2008

My assignment is to discuss mathematics in the management science of tomorrow. The preceding talks have dealt with potential uses by management of emerging and possible scientific developments. In approaching my assignment I would like to shift the emphasis slightly in order to discuss possible repercussions of a developing science of management on mathematics as well as possible repercussions of mathematical developments for the science of management.
Presidential Address to TIMS
Authors: Cooper W. W.
Published: November 2008

Presidential address about the background leading to TIMS formation. Delivered before the first national meeting of the Institute of Management Sciences, Oct. 21–22, 1954. Parts of the address are omitted.
Management Science, The Journal
Authors: Churchman C. West
Published: November 2008

These remarks are concerned with the policies of the journal of the Institute. A journal not only serves as a basis of communication for its time, but also as a monument of effort for some future age. The singularity of the title Management Science dedicates us to the proposition that a science of human administration is a real possibility. Whatever sort of monument our journal may be for the future, its keystone will consist in this conviction.
Statistics in Middle Management
Authors: Roberts Harry V.
Published: November 2008

This paper is about the use of simple statistical techniques by middle management in the solution of day-to-day problems. It is based almost entirely on term papers prepared by students in the statistics course of the Executive Program at the School of Business of the University of Chicago in 1952, 1953, and 1954.
An Axiomatization of Utility Based on the Notion of Utility Differences
Authors: Suppes Patrick , Winet Muriel
Published: November 2008

In the literature of economics the notion of utility differences has been much discussed in connection with the theory of measurement of utility. However, to the best of our knowledge, no adequate axiomatization for this difference notion has yet been given at a level of generality and precision comparable to the von Neumann and Morgenstern construction of a probabilistic scheme for measuring utility. (The early study of Wiener is not axiomatically oriented.) The purpose of this paper is to present an axiomatization of this notion and to establish the expected representation theorem guaranteeing measurement unique up to a linear transformation.
Solution of Nonlinear Programming Problems by Partitioning
Authors: Rosen J. B. , Ornea J. C.
Published: November 2008

An important class of mathematical programming problems is the scheduling of manufacturing and transportation systems. In many cases, the independent variables which describe the manufacturing system are interrelated in a highly nonlinear manner. The majority of the system variables are normally required to represent transportation and allocation. These variables appear linearly and must satisfy a system of equalities which is very large if considered as a single matrix.

With such systems it is usually possible to select a relatively small number of the system variables so that when these selected (decision or coupling) variables are held fixed the complete nonlinear system can be partitioned into a number of relatively small independent linear sub-problems.

An iterative method for the solution of such problems has been presented [Rosen, J. B. 1963. Convex partition programming. R. L. Graves, P. Wolfe, eds. Recent Advances in Mathematical Programming. McGraw Hill, 159–176.]. The method starts with initial values for the decision variables and solves the separate linear subproblems. The optimal solution to each subproblem is then used to determine that the complete system optimum has been found or to find improved values of the decision variables. This procedure is continued until the complete system optimum has been obtained.

Application of the Partition Programming method to a typical large manufacturing-transportation system will be described, including computational experience. This will illustrate that the method can be successfully used for systems which do not satisfy the mathematical requirements which insure convergence of the method to a global optimum. The economic interpretation of an optimal solution will be discussed, showing how the complete system shadow prices are obtained from those of the individual subproblems.
Opportunistic Replacement of a Single Part in the Presence of Several Monitored Parts
Authors: Radner Roy , Jorgenson Dale W.
Published: November 2008

In a system with several stochastically failing parts and economies of scale in their maintenance, it may be advantageous to follow an “opportunistic” policy for maintenance. In opportunistic policies the action to be taken on a given part at a given time depends on the state of the other parts of the system.

For the model considered in this paper, it is assumed that all parts of the system but one are inspected continuously (monitored) and that the remaining part cannot be inspected except when it is replaced. If the monitored parts have exponential distributions of time to failure, the optimal replacement policy for the remaining part has the following form:

Let the non-monitored part be labeled 0 and let there be M monitored parts, labeled 1, …, M; then there are M + 1 numbers n1 , …, nM, N, with 0 ≦ ni ≦ N ≦ ∞ such that:

(a) if Part i fails at a time when the age of Part 0 is between 0 and ni, replace Part i alone (i = 1, …, M);

(b) if Part i fails at a time when the age of Part 0 is between ni and N, then replace Parts 0 and i together;

(c) if Part 0 reaches age N at a time when all monitored parts are good, replace Part 0 alone.

It is demonstrated that the parameter N is finite provided that the reliability of the non-monitored part approaches zero as the age of this part goes to infinity.

These results are proved for several alternative criteria for evaluating replacement policies. Computation of the parameters of the optimal policy is also discussed. Applications of this policy are discussed in [Jorgenson, D., J. J. McCall. 1962. Optimal Scheduling of Replacement and Inspection. The RAND Corporation, Memorandum RM-3098-PR, May.].
Operating Characteristics of Opportunistic Replacement and Inspection Policies
Authors: McCall J. J.
Published: November 2008

This paper calculates some of the operating characteristics of opportunistic replacement and inspection policies. An operating characteristic of a particular policy is a function defined on the stochastic process induced when the policy is implemented. An opportunistic replacement policy makes the replacement of a single uninspected part conditional on the state (good or failed) of one or more continuously inspected (monitored) parts. An opportunistic inspection policy makes the inspection of a non-monitored part conditional on the state (good or failed) of a monitored part. Some of the operating characteristics of these policies examined in this paper are: the expected rate of opportunistic (joint) replacement of the uninspected part and one of the monitored parts; the expected rate of planned replacement of the uninspected part; the probability of at least m failures of a monitored part in the interval [0, t]; the expected rate of opportunistic inspection—inspection of the non-monitored part which is triggered by a failure of the monitored part; and the expected rate of planned inspection of the non-monitored part. These operating characteristics are precisely the information needed to establish a suitable supply policy. They should also be helpful to the maintenance manager in his efforts to predict the relative frequencies of the various maintenance actions. As an example the opportunistic replacement policy is applied to the rocket engines of a hypothetical ballistic missile. Several operating characteristics are then computed and the sensitivity of these operating characteristics to changes in the rocket engine failure rate is exhibited. This illustrative analysis indicates that both the expected rate of opportunistic (joint) replacement of the rocket engines and re-entry vehicle and the expected rate of replacement of the rocket engines due to mandatory replacement are highly sensitive to changes in the rocket engine failure rate. On the other hand, the expected rate of opportunistic (joint) replacement of the rocket engines and the guidance and control system is relatively unaffected by changes in the engine failure rate.
Possibilities for Application of Operational Research to Problems of Development
Authors: Tinbergen J.
Published: November 2008

The organizers of this meeting have asked me to summarize the discussions of the last three days and to draw some conclusions. These will have to be provisional and personal conclusions only, formulated in all modesty, since I am not an expert in several of the more sophisticated methods discussed here.

While the term “operational research” has not, as far as I know, a very precise meaning, we may nevertheless characterize it by: (1) treating complicated problems with a large number of variables; (2) using various modern mathematical and logistic methods; and (3) being directed toward a goal of action.

Its success has been proved already especially solving a number of problems in manufacturing industries, transportation and energy, fields for which usually precise and abundant data are available which make it worthwhile applying sophisticated methods.

When we ask whether this complex of methods can also be applied to development problems, it seems appropriate to summarize also what seems to be characteristic for these problems.
A Heuristic Approach to Solving Travelling Salesman Problems
Authors: Karg Robert L. , Thompson Gerald L.
Published: November 2008

A code for solving travelling salesman problem employing heuristic ideas is described. Acyclic permutations of the cities are constructed by first choosing two cities at random for a permutation of length two, putting the remaining cities in a random list and then inserting cities from the list in the partially constructed permutations so that they add least to the length of the partial tour. A second heuristic idea used in the code is that of breaking up the problem into convex, or almost convex sub-problems and employing the above-mentioned heuristic on these subproblems. Numerical experience with the code is described as well as weaknesses and strengths of the method.
Queuing when Jobs Require Several Services which Need Not be Sequenced
Authors: Evans Richard V.
Published: November 2008

Several queuing models are considered in which a job requires a number of different services. The services are performed in any sequence, possibly simultaneously, by a number of servers. Steady state probabilities are found for two service jobs processed by two server systems. In the first system, the two servers work on the same job if they are working. In the second system, the servers may work on different jobs. If server one is working on job k, server two may be working on job k − 1, k, or k + 1 but not on k − 2 or k + 2. In these systems, the servers are specialists. In the third system, the servers may perform either of the two required services. If one has bogged down, the other server does both parts of each job.
Nonlinear Programming Problems with Stochastic Objective Functions
Authors: Mangasarian O. L.
Published: November 2008

In many optimization problems the objective function may depend on a random set of coefficients that have some known distribution. For example, a profit function may depend on certain market conditions which can at best be estimated by a set of random variables with some given distribution. An important question to be answered in such problems is: What is the expected value of the maximum profit? On the answer to this question may hinge certain very important decisions that an organization may have to make. It may also provide good estimates of future profits. While the problem of determining the expected value of the maximum may be very difficult at times, a number of related problems, some quite important in their own right, may be considerably easier to solve and also may provide bounds for the expected value of the maximum. In this work, one upper and three lower bounds are given in terms of the solutions of related problems. In addition a convexity property for a class of parametric nonlinear programming problems is obtained. This property is also used in deriving some of the bounds.
Systems Theory and Management
Authors: Johnson Richard A. , Kast Fremont E. , Rosenzweig James E.
Published: November 2008

Ludwig von Bertalanffy, in 1951, and Kenneth Boulding, in 1956, wrote articles which have provided a modern foundation for general systems theory [Bertalanffy, L. von. 1951. General system theory: A new approach to unity of science. Human Biol. (December) 303–361; Boulding, K. 1956. General systems theory: The skeleton of science. Management Sci. (April) 197–208.]. We build on that foundation in applying general systems theory to management.

The general theory is reviewed for the reader. Next, it is applied as a theory for business, and an illustrative model of the systems concept is developed to show the business application. Finally, the systems concept is related to the traditional functions of a business, i.e., planning, organizing, control, and communications.
The Psychological Transition From Management Scientist to Manager
Authors: Holt Herbert , Ferber Robert C.
Published: November 2008

In this paper we endeavor to show how a management scientist maintains his integrity and individuality while changing from a staff position to a consultant position and eventually to a top executive position in a large company. It is a segment of a longitudinal study and is presented in a special format, which makes it possible to present the data at all.

In the introduction we utilize an historical sketch of the management field to show at what time in the development of management science this particular person's career started and, thereby, some of the factors which helped mold his personal and character values. The vicissitudes of the problem are elaborated and background material given for the understanding of the issues involved. We hope to encourage others to present similar segments of longitudinal studies which, we feel, will help people seriously engaged in this field to develop theories based on clinically-gathered data and which will, therefore, be closer to the truth of what really happens under certain conditions in which certain human beings have an impact on large-scale organizations and vice versa.
The Naval Aviation Supply Office Inventory Retrieval System—A Case Study in File Automation
Authors: Zimmerman Barry , Lefkovitz David , Prywes Noah S.
Published: November 2008

This article describes the case history of the pilot mechanization of files at the Naval Aviation Supply Office. The system described retrieves information on a real-time basis from a large file of technical and inventory data stored on magnetic disk memory. A feature of the system is the use of the Multi-List technique which stores an addressing index in the form of trees that provide access to the main file. The main file may be accessed by many different types of descriptors. Input to the file is via magnetic tape, console inquiry, or remote interrogation station. File and tree construction, the use of linkages between items to form lists, and the executive routine are described.
On a Problem of Production Planning for a Non-Storable Commodity
Authors: Zaki R. M. , Bhattacharyya B. B. , Anderson R. L.
Published: November 2008

This paper is concerned with the decision problem faced by a firm which produces a non-storable commodity and has to spend large amounts of capital on a specialized factor that could remain idle part of the time because of fluctuations in production. The optimum decision rule is derived under one resource restriction and an explicit parametric solution has been obtained. The model has then been extended to incorporate more than one resource restriction, for which certain parametric solutions have been obtained.
The Engineering Change of the Total Requirements Matrix for a Bill of Materials
Authors: Gleiberman Leon
Published: November 2008

Matrix methods for various “bill of materials” computations have been described in papers by Vazsonyi [Vazsonyi, A. 1954. The use of mathematics in production and inventory control. Management Sci. 1 (1, October) 70–85; Vazsonyi, A. 1958. Scientific Programming in Business and Industry. Wiley, 429–452.], Vazsonyi and Larson [Vazsonyi, A., H. T. Larson. 1955. Data-processor requirements in production and inventory control. Proceedings of the Western Joint Computer Conference, 48–61.], and Giffler [Giffler, B. Mathematical solution of production planning and scheduling problems. IBM Technical Report 09.01028.026.]. Wide-spread use of these ideas has been hampered by the large amount of computation that the basic “total-requirements” matrix T involves. In this paper, a new and efficient iterative method for engineering changes of T is discussed, and this method is applied to the original generation of T, and to the inversion of certain matrices.
The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
Authors: Candler Wilfred , Townsley Robert J.
Published: November 2008

A simplex-type method for finding a local maximum of [Formula: see text] subject to [Formula: see text] and [Formula: see text] is proposed. At a local maximum, the objective function (1), can be expressed, in terms of the non-basic variables λ0, as [Formula: see text] and the vector of partial derivatives of (13), with respect to the non-basic variables may be written, [Formula: see text] This allows calculation of the maximum values of the non-basic variables, increased one at a time, consistent with ∇Z ≧ 0. A “cutting plane” a**λ′ ≧ 1 is then defined which excludes the local optimum, and many lower values (but no higher values) of (1).

The form of the square matrix C is immaterial.
The Dynamic Effects of Planning Horizons on the Selection of Optimal Product Strategies
Authors: DeVries Marvin G.
Published: November 2008

The selection of appropriate product strategies by firms must account for the expected long-run returns from the market a firm contemplates entering, relative to the expected long-run returns from the market it is currently serving. These expected returns must also reflect the capabilities a firm has to implement this strategy and the resulting competitive situations it will face. The mathematical techniques of Markov processes and dynamic programming are used in this paper to develop an analytic framework which will select optimal product strategies for a firm that are consistent with its capabilities, that will meet its competitive situations, and that will maximize expected returns in the long run. This model is applied to a selected set of Michigan machine tool firms. The results indicate the general importance of total firm capabilities and the greater importance of management capability over the supporting capabilities in the selection of optimal product strategies.
Management Science and Marketing Science
Authors: Starr Martin Kenneth
Published: November 2008

This paper considers the contributions which management science has made toward the development of a science of marketing. It is convenient to appraise the present situation in decision theory terms. Insight and understanding are fostered by differentiating the difficulties encountered by management science in marketing from those in production. The two-culture problem, and its inhibiting effect upon advancements in marketing science, is discussed. The concluding section of the paper suggests some steps that might be rewarding if implemented in the future.
A Primal Method for the Assignment and Transportation Problems
Authors: Balinski M. L. , Gomory R. E.
Published: November 2008

This paper describes a simple calculation for the assignment and transportation problems which is “dual to” the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal and so gives a feasible assignment at each stage of the calculation. Bounds on the number of steps required for the assignment and transportation problems are given. They are the same as the best bounds known for the Hungarian Method.
Organizational Factors Affecting Research and Development Decision-Making in Large Decentralized Companies
Authors: Rubenstein Albert H.
Published: November 2008

The design of a long term research program on the organization of R and D in decentralized companies is presented. The decentralized firm and the various deployments of R and D in such firms are described. Data is given on the incidence of the various organizational forms in five industry groups. The classes of decisions commonly encountered in R and D are indicated. Categories for describing and analyzing the assigned mission of an R and D lab are presented.
Optimal Policies for the Inventory Problem with Negotiable Leadtime
Authors: Fukuda Yoichiro
Published: November 2008

In this paper we study the dynamic inventory problem in which amounts of stock ordered at unit prices ck and ck+1 (ck > ck+1) are delivered, respectively, k and k + 1 periods later. It is demonstrated that under suitable cost conditions, the optimal policies are similar to those of the dynamic inventory problem with a delivery lag of k + 1 periods, except for an additional constant stock level up to which it is desired to order at unit price cK. If we assume that ordering decisions are made in every other period, it is demonstrated that analogous results are obtainable for the case in which amounts of stock ordered at unit prices ck, ck+1, and ck+2 (ck > ck+1 > ck+2) are delivered, respectively, k, k + 1, and k + 2 periods later.
A Heuristic Procedure for Parallel Sequencing with Choice of Machines
Authors: Schwartz Eugene S.
Published: November 2008

An algorithm is described for parallel sequencing on two machines of a set of operations with partial ordering constraints. Some assignments are fixed and some are flexible allowing a choice of machines; operation times for the flexible assignments are assumed to be equal. The algorithm establishes a parallel sequence that seeks to minimize the elapsed time required for both machines to complete processing without testing the set of possible permutations on operations. Assignment decision rules are formulated to balance the parallel sequences considering accumulated time and remaining future commitments on each machine. Experimental results comparing programmed solutions with lower bounds of running time are given.
Optimum Plant Design for Seasonal Production
Authors: Coleman J. R. , Smidt S. , York R.
Published: November 2008

A systematic optimization procedure is developed for the design of a plant which is subject to uncertain, seasonal production. Based on a generalized seasonal production model, the present value of the cash flows associated with production by means of a combination of alternates is expressed in terms of the unknown capacities. On the basis of the derived solution, a systematic procedure is presented which yields optimum designs without reference to the involved mathematics. Finally, the more important assumptions are removed and suggestions are given with respect to the modifications that are required in order to extend the method to more complex problems.
Development Planning in Underdeveloped Countries
Authors: Bhende Vinay P.
Published: November 2008

This paper shows in a hypothetical and illustrative manner, how a linear programming model of moderate size can be used in selecting projects for a national development program, without requiring the construction of a model that covers the whole of the economy in detail.
The Transportation Problem with Stochastic Demand
Authors: Szwarc Wlodzimierz
Published: November 2008

The transportation problem with stochastic demand is considered when penalties are paid for each oversupplied and undersupplied unit of product. The transportation plan minimizing the total transportation costs plus total expected penalty cost of both kinds is to be found. The paper presents a method of solution which is preceded by a development that replaced the original cost function with a controlled linear approximation.
Optimal Resource Use Over Time with an Application to Ground Water
Authors: Burt Oscar R.
Published: November 2008

This paper is concerned with optimal allocation over time of a single resource which is either fixed in supply or only partially renewable at a point in time. Some resources which fall in this category are mineral deposits, ground water, petroleum, wildlife, and fish. A functional equation is obtained from a dynamic programming formulation of the problem. This functional equation is used to derive approximate decision rules for resource use as a function of current supply. The results are applied to ground water storage control and tested empirically by comparison with a decision rule obtained by detailed numerical methods.