bluuebunny/crossref_metadata_2025_split huggingface dataset:
The Contribution of Systems Research to Long-Range Planning in the Defense Industry
Authors: Tombach Harold 
Published: November 2008

Industrial long-range planning requires forecasts of market requirements, business environments and corporate (or divisional) capabilities. This article concerns itself with the problem of forecasting weapon markets. The needs for such forecasts are discussed and it is shown that mere reliance on official military plans, programs, statements, and “requirements” is a poor guide for long-range planning in the defense industry. It is further shown how system research studies can improve the forecasts sought. The proper conduct of such long-range-planning-oriented studies is outlined in some detail. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Total Systems Concept
Authors: Graham Richard W. 
Published: November 2008

There has been much written about “Scientific Management,” and its value and application to business operations. Advances in technology, particularly in the field of electronic computers, have stimulated changes of a significant nature in how data is obtained and processed in a business organization. With the development of more sophisticated machines to manipulate data rapidly and easily, there have been advances made in techniques to analyze and evaluate the data being processed. Various statistical methods and optimization schemes have become common tools to the scientist, market specialist, and financial analyst. The union of such techniques with electronic computers has resulted in the solution to many problems which heretofore were infeasible, if not impossible. The end result is that, today, management has at its disposal the tools and techniques to obtain and evaluate more data than ever before in the history of business. Data of itself, however, is meaningless. It is the combination of data in its various aspects which makes available to management that which it must have to operate effectively—that is, information. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
The Role of Information Systems in Decision Making
Authors: Chambers R. J. 
Published: November 2008

The growing literature of decision-making focusses attention on the selection of an optimal course from a series of hypothetical courses. Discovery of the position from which future action is to be taken has received rather less attention. Information systems are considered as means of discovering the facts antecedent to decision and action. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Second Generation Management Analysis
Authors: Ortner J. L. 
Published: November 2008

There has been a steady introduction of new methods and techniques in the management area during recent years, and numerous speakers have made presentations to you in each of these areas. Nevertheless, I have somewhat presumptuously, I must admit, entitled my talk “Second Generation Management Analysis.” This title carries the connotation that all previous developments may be classed as the first generation, and we are now ready to enter the second generation. This connotation is exactly what I wish to portray since I feel it properly reflects where we stand today. My task now is to justify this claim to you. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Acquisitions Planning Panel
Authors: Dettmer Robert , Bokum William H. , Kirkpatrick Neil , MacKinnon A. M. , Stillman Robert D. 
Published: November 2008

Condensed transcripts of the Acquisitions Planning Panel of the TIMS College of Planning, Moderator was Robert Dettmer, panelists were William H. Bokum, Neil Kirkpatrick, A. M. MacKinnon, and Robert D. Stillman. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Research and Development Planning Panel
Authors: Gross Norman , Barnes Carl B. , Hannock Julius , Hufnagel R. , Rose Robert S. 
Published: November 2008

Condensed transcripts of the Research and Development Planning Panel of the TIMS College of Planning. Moderator was Normal Gross, panelists were Carl B. Barnes, Julius Hannock, R. Hufnagel, Robert S. Rose, Jr. Management Technology, ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.
Evolution of a “Science of Managing” in America
Authors: Smiddy Harold F. , Naum Lionel 
Published: November 2008

Wherever people have gathered to pursue a common and desired end, there has been an inevitable necessity to organize minds, hands, materials, and the use of time for efficient and contributive work. Man has learned that individual and personal rewards derive largely from an harmonious combination of individual work and teamwork in a soundly organized frame of reference, and thus the core of the history of “Scientific Management” is formed from his search for the techniques of joint but voluntary participation while still preserving individual initiative, creative imagination, and increasingly productive output. Any historical survey, to be of more than passing interest, and to be more than a simple chronology of dates and names, needs to seek out the philosophical drives which both stimulated and limited the progress of such a scientific approach to more rational conception and performance of managerial work, that is, of securing results through the organized efforts of others. While it is important to know when things happened, this knowledge only becomes significant and useable when it is understood why things happened. This paper, therefore, is intended to outline the gradual historical development of the search for the basic principles of a “Science of Managing,” and thus of Scientific Management, rather than to be a simple recounting of experiment, methodology, or significant writings in that field.
An Inventory Problem with Discrete Time Review and Replenishment by Batches of Fixed Size
Authors: Resh M. , Naor P. 
Published: November 2008

An inventory system under periodic review is considered. If at the time of review the stock has fallen below a given level, L, a fixed quantity, Q, is ordered; otherwise no action is taken. It is assumed that delivery time is negligible. Two costs are considered to be of importance: one proportional to the average overage, the second proportional to the average shortage. Under exponential demand assumptions optimal values of L and Q are obtained.
The Power of a Coalition
Authors: Maschler Michael 
Published: November 2008

If certain information is given about the “psychology” of the players who participate in an n-person cooperative game, concerning their bargaining abilities, their moral codes, their roles in the various coalitions and their a priori expectations, then it is possible to define a measure for the power of each coalition which, perhaps, is a better description of the game than the usual characteristic function. The required information, called the standard of fairness of the players is a Thrall partition function which satisfies certain requirements. Its determination is discussed both from an experimental and from a theoretical point of view. In terms of the power, every game becomes a constant-sum game. Applications to the von Neumann and Morgenstern solutions and to the bargaining set are discussed.
A Test of a Statistical Method for Computing Selected Inventory Model Characteristics by Simulation
Authors: Geisler Murray A. 
Published: November 2008

This article is a companion piece to M. A. Geisler, The Sizes of Simulation Samples Required to Compute Certain Inventory Characteristics with Stated Precision and Confidence, MANAGEMENT SCIENCE, January, 1964. Special statistical methods were used in that article to compute the sample sizes for specified inventory models. In this article, the methods were tested by applying them to particular inventory cases, and determining how well the actual precision and confidence obtained in the estimates agreed with expectation. We found that the actual precision and confidence obtained for each of the inventory policies and procurement lead-time cases tested did correspond closely with expectation. Thus, it was expected that 95 per cent of the samples of the zero procurement lead-time cases tried would have sample values within 100 per cent of the true mean value. In the shortage calculations, the results ranged from 94.3 to 97.6 per cent, and for the overages, the range was from 95.6 to 99.9 per cent. From this test, we concluded that the statistical procedure given in the prior article is valid, and produces reliable estimates of mean shortages and overages per period.
Optimal Policies for a Class of Search and Evaluation Problems
Authors: MacQueen James B. 
Published: November 2008

A person searches through a population of possible actions, looking for one with high value. He discovers these actions one after another, paying a certain cost each time. On his first encounter with a possible action, the person obtains some preliminary information about its actual value, and at this point he can take the action, he can continue looking, or, at a certain cost, he can perform a test and obtain some more information about its actual value. If he decides to test, then having obtained the additional information he can again either take the action or continue looking. The problem is to conduct this process in such a manner as to maximize expected net value, that is, the expected value of the action finally taken minus the expected total cost of searching and testing. This problem is analyzed and optimal policies are given in the case where the possible actions are regarded as independent selections from a large population. The joint distribution in this population of the actual value, the preliminary information, and the additional information gained from testing, is assumed to be known. The situation where many possibilities are to be selected, subject to a budget constraint on total search and testing cost, is also treated. For this problem asymptotically optimal results are given for large budgets.
Estimating Reliability After Corrective Action
Authors: Corcoran W. J. , Weingarten H. , Zehna P. W. 
Published: November 2008

A model is defined wherein corrective action may be accounted for in improving the estimation of reliability over the usual nominal success ratio. Probabilities for correcting any one of K failure modes which may arise are assumed known and a multinomial sampling procedure is discussed. Mean reliability is defined as a function of the unknown probabilities attached to the failure modes and the problem of estimating this parameter is posed. Two procedures which have been typically used in the past are discussed and some obvious weaknesses are pointed out. We then proceed to investigate several new estimators which we propose for the problem. No attempt is made to optimize with regard to a choice of estimators but properties of each of them are discussed which point to their limitations as well as usefulness in a given problem. Finally, we discuss some of the implications of the model we have assumed and propose other models that might be worthy of merit. Recommendations are made for further research in this timely and important area of investigation.
Economic Effects of Technological Innovations
Authors: Gold Bela 
Published: November 2008

This paper reports on research which is both historical and analytical. The historical aspect of this study comprehends the years 1899-1939 and reports on the behavior of costs, wages, output and related physical measures in 5 basic industries plus “all manufacturing.” Generally speaking the ratios of labor and capital inputs to total output during this period do not show the kinds of “substitution effects” that might have been expected during the period covered. The data indicate that technological innovation and investment were, in fact, neutral in terms of labor-capital ratios which prevailed during this period. These are, of course, only long-run phenomena. Transient patterns generally produce changes in the physical ratios which, however, are subsequently offset in value terms. Furthermore only industry aggregates are examined. Evidently, then, any individual firm may find itself out of line with these ratios at any moment of time depending on its status as an innovator, follower, etc. Flow models are developed to interpret and explain these results. In these models the physical substitutions are depicted as being subsequently counterbalanced by market price reactions flowing from these (or other) investment decisions. These models are, of course, not restricted to the period under consideration and can therefore be used to guide analyses and investigations for subsequent periods. Thus, for instance, consider the investment decisions of management in the period under review—i.e., 1899-1939. These decisions were based on piecemeal analyses and rule-of-thumb guides. Is it the case that more sophisticated techniques—such as those which accompany operations research developments—will produce a difference in the observed ratios of labor to capital inputs in these (or other) industries? The models and the results presented in this study raise this question in a way that may prove helpful in a subsequent analysis designed to test the effects of operations research—or other factors—on the investment decisions now being undertaken. Alternatively, these models and results may provide helpful guidance in particular applications. Thus, for instance, if persistence is assumed for the phenomena we note, then issues of short- vs. long-run strategy become of major importance for possible consideration and incorporation in any operations research models used to guide investment decisions.
The Generalized Stepping Stone Method for the Machine Loading Model
Authors: Eisemann Kurt 
Published: November 2008

This paper gives a detailed description of an algorithm for the solution of a specialized Linear Programming model, to be called the Machine Loading model. It is a generalization of the Transportation Problem, in that weighting factors are applied to the individual elements which form the row and column sums. For the Machine Loading model, the simplex method reduces to a specialized algorithm which generalizes the stepping stone method of the Transportation Problem [2], [3]. With the resulting generalized stepping stone method, it becomes practicable to solve many large-scale problems for which the direct application of the simplex method would be impracticable. The present paper is restricted to a discussion of the following topics: (i) the general characteristics of the model and its topological features; (ii) a detailed solution algorithm, including a consideration of degenerate cases and the use of a computer; (iii) a more restrictive capacitated model and the corresponding modifications to the solution algorithm; and (iv) the complete illustrative solution of a numerical example. The purpose is to aid interested readers in gaining familiarity with the algorithm and facility in the solution of numerical problems. No derivations or proofs will be included.
Decomposition of Project Networks
Authors: Parikh Shailendra C. , Jewell William S. 
Published: November 2008

This paper considers “critical path” networks which are used for the planning and scheduling of projects that consist of well defined sequences of individual activities. When the number of activities is large, it becomes difficult to prepare a network for the project as one unit, and it may also be difficult to store the network in the high speed memory of a digital computer. Also, in the cases where there are two or more independent projects, which are weakly inter-related by common activities, the problem of efficient scheduling of all the projects becomes quite difficult. This paper presents a method to “tear” or “decompose” a project network into several subnetworks, schedule the subnetworks and then to put the subnetworks back together. A computational algorithm is first given for time-only networks; then two computational formulations are given for cost-time network of project subnetworks. The latter essentially generalize the algorithm due to Fulkerson, in order to handle piecewise linear, convex, cost-time curves for some or all of the activities.
Electronics in Management
Authors: Hertz David B. 
Published: November 2008

Since the end of World War II, the single most outstanding development in the world of business has been the economic renaissance of the Free World. From the devastation and dislocation left by 6 years of war, the Western business community has rebuilt and redirected itself in two decades of unparalleled growth and prosperity. The postwar prophets of gloom, who prognosticated postwar collapse and stagnation as in the Great Depression of the 1930s have long since been routed. And a serious economic setback appears now to be less likely than ever. Certainly the business manager of today can look back proudly on a job well done. Clearly this period has been a triumph for the free enterprise system and the traditional concepts and techniques of management. Nevertheless, the business managers of today cannot rest on these accomplishments. For change is in the air, and the traditional concepts of management cannot fully meet the challenge that it brings. These established concepts, of course, themselves originally evolved as new responses to new business challenges. And it is worth remembering that many of the familiar management techniques of today were not traditional concepts 20 years ago. The manager of 1946 would be very uncomfortable and unsure of himself in the sophisticated management world of today. New tools and techniques of management are taken for granted by today's manager. And the search for newer and better techniques presses on.
Statistical Control Applications in Linear Programming
Authors: Enrick Norbert Lloyd 
Published: November 2008

Solution of the product mix problem of Linear Programming leads to recommended quantities of various product styles that must be sold if the firm's ideal profit potential, based on productive capacity and market requirements, is to be realized. In practice, management has the task of making day-to-day and hour-to-hour decisions, designed to lead towards the attainable maximum profit. Sometimes, sudden opportunities arise for management to contract for the production of one product style for one customer, with quantities far in excess of those recommended in the L. P. solution. An on-the-spot decision to accept or reject the customer's bid must be made. Indeed, he may still be on the long-distance wire, expecting a response. Statistical control limits will help management in such situations, by showing the extent to which a recommended quantity on any product style may be violated, while still remaining within a predetermined percentage of the plant's ideal profit potential. Without such statistical control limits, management would have to await the outcome of a new L. P. analysis before knowing the effect of accepting or rejecting special bids, such as just described.
Independence, Trade-Offs, and Transformations in Bivariate Utility Functions
Authors: Fishburn Peter C. 
Published: November 2008

This paper explores several important notions relevant to modern utility theory. Restricting the discussion to the consideration of bivariate utility functions, the paper defines and examines the interrelationships between (1) independence in the utility sense, (2) trade-off or indifference curves, and (3) transformation curves (as defined herein). Following the form in which a set of basic axioms of utility are stated, independence is defined in terms of indifference between 50-50 gambles, and it is shown that, if the condition of the definition holds, then φ(x, y), the bivariate utility function, can be written as a function of x plus a function of y. The concepts of trade-off curve (indifference curve) and transformation curve are also defined on the basis of the indifference relation but are not concerned with gambles. After exploring relationships among the three notions it is shown how the utility curves for the two variables under independence can be constructed on the basis of two trade-off curves.
A Dynamic Programming Approach to a Lot Size Scheduling Problem
Authors: Bomberger Earl E. 
Published: November 2008

The problem considered is that of scheduling the production of several different items over the same facility on a repetitive basis. The facility is such that only one item can be produced at a time; there is a setup cost and a setup time associated with producing each item; the demand rate for each item is known and constant over an infinite planning horizon, and all demand must be met. A dynamic programming solution is developed. This solution is applied to a sample problem, and the results are compared with pertinent bounds.
Integer Programming: Methods, Uses, Computations
Authors: Balinski M. L. 
Published: November 2008

This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Included are descriptions of general algorithms for solving linear programs in integers, as well as some special purpose algorithms for use on highly structured problems. This reflects a belief, on the author's part, that various clever methods of enumeration and other specialized approaches are the most efficacious means existent by which to obtain solutions to practical problems. A serious try at gathering computational experience has been made—but facts are difficult to uncover. The paper is written with intent to enable readers to read selected sections without having to read the whole.
The (S − 1, S) Inventory Policy Under Compound Poisson Demand
Authors: Feeney G. J. , Sherbrooke C. C. 
Published: November 2008

This paper derives the simple analytic solution to the special but important inventory problem in which the optimal policy is to reorder whenever units are demanded. The demand distribution can be any compound Poisson; the resupply distribution is arbitrary. Both the backorder case and the lost sales case are solved by generalizing a queueing theorem due to Palm. The steady state probabilities for the number of units in resupply (or repair) completely describe the item's long term behavior, and are simply the normalized values of the compound Poisson demand distribution based on the mean of the resupply distribution but not on the distribution itself. Knowledge of these state probabilities enables us to compute several measures of item supply performance as a function of the spare stock, s. Traditional inventory analysis can then be applied to minimize total cost based on estimates of holding cost and supply performance cost. The appendices contain a description of the algorithm and the computer program for calculating stuttering Poisson state probabilities and the measures of effectiveness for the backorder case. Numerical illustrations are also provided.