Search

A simple linear model is constructed for production, use and recycling of various paper and related products. This model is used to estimate the maximum feasible recycling rate given the current state of pulp and paper technology. Parametric linear programming is used to investigate the effect of the efficiency of collecting, sorting and transporting waste paper on the fraction recycled. [ABSTRACT FROM AUTHOR]

This article presents several papers received for the November 1974 issue of the periodical "Management Science." Papers received include "Optimization of Traffic Signal Settings in Networks by Mixed-Integer Linear Programming," by N. Gartner, J.D.C. Little and H. Gabbay, "Intesections Cuts From Disjunctive Constraints," by E. Balas, and "Integer Programming," by Charles P. Bonini.

The article discusses points contained in the research papers of mathematician L.V. Kantorovich. There is little in either the Soviet or the Western literature in management, planning, or economics available in 1939 that could have served as a source for the ideas in this paper, in the concrete form in which they were presented. From its own internal evidence, the paper stands as a highly original contribution of the mathematical mind to problems which few at that time would have perceived as mathematical in nature-on a par with the earlier work of von Neumann on proportional economic growth in a competitive market economy, and the later work of Dantzig well known to readers of Management Science. Recently Kantorovich has published a book, "Economic Calculation of the Best Utilization of Resources," in which it is proposed that linear programming methods be applied in nationwide planning for the Soviet economy. This has already given rise to a lively debate in Russian economic and planning periodicals.

The article presents abstracts of contributed papers submitted for presentation at the Chicago Meeting. The paper "Computer Simulation in a Missile Operational Cycle," by Robert T. Morrison explains a model of a hypothetical weapon system is analyzed by simulation techniques using a digital computer. All the important parameters affecting the model are identified and values selected. Random numbers selected by the computer are used to determine the occurrence of missile and GSE malfunctions according to the failure rates established and also to determine the repair times for the missiles and GSE if malfunctions occur. Another paper "A Measure of Effectiveness for Weapon-System Evaluation," by Robert T. Morrison explains a concept for a measure of effectiveness is developed for evaluating and judging weapon-system design and operation The proposed measure of effectiveness considers the most important factors in any complex system-maximum performance and reliability with minimum cost and time This paper shows how the measure of effectiveness is valuable for system analysis in judging between alternative proposed systems in preliminary design and measuring and evaluating the selected system progress from prototype design through final system operation and maintenance.

"Tele," English Edition No 1, 1957, Information from The Royal Board of Swedish Telecommunications, edited by E Malmgren, contains five papers by Conny Palm prefaced by a short article, "Research on Telephone Traffic Carried by Full Availability Groups." The first paper, "Some Propositions Regarding Flat and Steep Distribution Functions," characterizes two classes of distribution functions arising in telephone traffic congestion. In the second paper, "Some Observations on the Erlang Formulae for Busy Signal Systems," an attempt is made at a brief systematic investigation of the form and properties of the most important traffic functions, in addition to some numerical calculations and tabulation procedures. The third paper is called, "Contributions to the Theory on Delay Systems" Unlike a busy-signal system in which a call that finds all channels occupied makes a new try at calling later, a delay system permits a call to wait to obtain service. The fourth paper is called "Waiting Times with Random Served Queue." The fifth paper is entitled "Duration of Congestion States in Delay Systems" To avoid long delays it is desirable first to study the distribution function for the duration of the congestion states.

A heuristic procedure for scheduling production rolls of paper through a finishing operation to cut them down to finished roll sizes is described. The ratio of service time to interarrival time of production rolls at the initial cutting station is large so that insufficient time is available to set it up unless a minimum number of production roils are to be processed in the same manner. Otherwise, some portion of each production roll must go through a reprocessing operation to complete the cutting of finished sizes. The objective is to minimize the cost of trim loss and reprocessing. The procedure generates cutting patterns and usage levels sequentially until all the requirements are satisfied. At each step the search is dependent upon the characteristics of the unsatisfied requirements. A maximum of three solutions is generated for each problem. If none satisfies a predetermined aspiration level, the best of the three is chosen. The procedure was evaluated by scheduling a specific paper production facility and observing the results for a set of 15 problems. For each problem, the best solution was recorded. The overall results from this set of problems were then compared to previously recorded results on problems solved manually. There was a 16% improvement in solution quality for the heuristic procedure relative to the manual method. [ABSTRACT FROM AUTHOR]

Presents news items related to events concerning various operations research societies as of September 02, 1961. Composition of the board of Netherlands Operations Research Society; Officers elected for the 1961-62 season for The Philadelphia Section of the Operations Research Society of America (ORSA); Second annual meeting of the northwest section of ORSA held in Seattle, Washington on August 4, 1961.

The article discusses various articles published within the issue, including one by C. Eastman, N. Johnson, and K. Kortanek about using urban citizens as means of gaining information on citizens attitudes toward city planning.

In a paper on ‘Stationary Properties of a Two-Echelon Inventory Model for Low-Demand Items’ [Opns. Res. 19, 761–773 (1971)], R. M. Simon presents an argument for finding the stationary distribution of inventory position that is not always valid. This note gives a corrected version of Simon's method. [ABSTRACT FROM AUTHOR]

This note presents some comments on BONDER'S paper on the Lanchester attrition-rate coefficient, which indicate that a valid prediction of average attrition is obtained by using the harmonic mean of the variable attrition rates rather than the arithmetic mean. This change results in a constant Lanchester attrition-rate coefficient being defined as the reciprocal of the expected time to kill a target. An alternate and more general method for obtaining the constant coefficient is presented and some comparative results are displayed. An appendix indicates the conditions for which it is appropriate to use the harmonic and arithmetic means of rates in general. [ABSTRACT FROM AUTHOR]

With a view to ascertaining the optimum number of stand-by systems, this paper derives the expected cost function for operating n independent systems for a time period of length t, with s spare systems available. [ABSTRACT FROM AUTHOR]

A matter that has received scant attention in the literature of operations research is the role of discrepancies between physical stocks and stocks of record in a supply operation. Discrepancies not only exert a deleterious effect on the performance of the supply function, but may have a serious effect on the realization of benefits to be derived from implementation of theoretically optimal methods of inventory control and procurement or production scheduling. The present paper reports on a case study of discrepancies and their causes in a supply facility of an agency of the Federal Government Contrary to the general expectation that the massive and complex paper work system connected with processing of issues and receipts was the principal source of discrepancies, it was possible to determine that about 80 per cent of the discrepancies were caused by the discrepancy-correcting procedures themselves. As a result two principal targets for further study are clearly delineated, (1) the inventorying process and (2) the stock balance adjustment procedures. Even on the basis of preliminary study some ameliorating recommendations were possible. [ABSTRACT FROM AUTHOR]

The article presents the 1966-1969 meeting schedule for The Institute of Management Science (TIMS). The 13th International meeting will take place in Philadelphia from September 6-8, 1966. Warsaw, Poland, will host the European Section meeting held jointly with the Econometric Society from September 2-7, 1966. The American Meeting of TIMS will be held in Boston from April 5-7, 1967.

This paper gives a framework for unifying and slightly generalizing certain properties of extreme-point solutions exploited by an approach of LEMKE, SALKIN, and SPIELBERG for solving set-covering problems. [ABSTRACT FROM AUTHOR]

The article presents the meeting schedule for The Institute of Management Science (TIMS). The 13th International meeting will take place in Philadelphia, Pennsylvania, from September 6-8, 1966. Warsaw, Poland, will host the European Section meeting from September 2-7, 1966. The American meeting is scheduled for April 5-7, 1967 in Boston, Massachusetts. Detailed meeting information is provided.

Commentary is presented for the article "Three Modes of Conflict," by Anatol Rapoport, published in the April 1, 1961 issue of the periodical "Management Science." The author notes that he is in agreement with many of Rapoport's principles concerning conflict resolution, but is unconvinced of the applicability of these principles. According to the author, at the time of publication Rapoport's assumptions surrounding conflict resolution are invalid when an attempt is made to apply them to the conflict between the United States and Soviet Union.

Comments on the paper 'A General Method for Nonlinear Programming,' by Anthony V. Fiacco, Nicholas M. Smith and David Blackwell. Application of the principle of entry into a constrained space to Carroll's technique; Computation of the starting point for the original problem.

The Operations Research Society of America/Transportation Science Section's (ORSA/TSS) Workshop "Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services," seals with the development and application of automated techniques for the scheduling of vehicle operators for urban public transportation services. The Urban Mass Transportation Administration, American Transit Association, and Union Internationale des Transports Publics are cooperating with ORSA/TSS to assure the workshop's success. Authors are invited to propose papers dealing principally with the following areas, heuristic and mathematical programming approaches to the assignment of vehicle operators; strategies for crew rotation schedules; interactive computer methods; reviews of implementations of automated scheduling systems; costs and benefits of automated techniques; and comparisons with manual scheduling techniques. Short abstracts should reach by November 1, 1974 and full manuscripts by January 1, 1975.

The program for the 1966 TIMS American Meeting at the Statler Hilton, Dallas, Texas is presented.

Commentary is provided for the article "The National Security Dilemma: Challenge to Management Scientists," by Marshall K. Wood, published in the April 1, 1961 issue of the periodical "Management Science." The author disagrees with Wood's assertion that the development of international law be contingent on the development of a United Nations military force. Also discussed are Wood's views concerning potential protocols in the case of a nuclear attack, including the implementation of a population shelter initiative.

This article focuses on a study which analyzed a game theory model in a horserace betting environment. The environment expresses hostility by dispatching police forces to various establishments. The interaction of the police and the agents of the entrepreneur results in the arrest of some of the agents. The number of the arrests is assumed equal to the product of the volume of bets made at the establishment raided and the number of police sent there, multiplied by a factor depending on the character of the neighborhood in question.

The article presents comments on the management science paper "On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs," by William L. Maxwell. The paper focused on an integer programming formulation of a one-machine job shop problem. The author contends that Maxwell made in error in proving the validity of an optimal algorithm by applying cutting plane constraints to the problem. The author explains that the problem cannot be solved through traditional cutting plane procedures. The author provides a mathematical model in an attempt to correct the proof.

This note considers an inventory model for repairable stock items for which S. G. ALLEN AND D.A. D'ESOPO had previously derived an approximate expression for backorder rate, derives an exact expression for the stationary distribution of stock on hand and backordered under considerably more general assumptions, and shows that the backorder rate can be calculated exactly from this. The stationary expected number of backorders per unit time can also be calculated from this distribution. [ABSTRACT FROM AUTHOR]

This paper generalizes, by the use of compound distributions, a result of HAIGHT (1966) on counts that are delayed but not lost. An application of Markov chains indicates a simple method of numerical evaluation of the distributions involved. Finally a continuous time analogue is studied. [ABSTRACT FROM AUTHOR]

This article presents a list of books related to operations research. Some of the books listed are "A Concept of Corporate Planning," "Elements of Linear Programming," "The Costs of Accidents: A Legal and Economic Analysis," "The Single Server Queue," and "The Economics of Bargaining."

Presents a list of books related to operations research.

The article presents the author's comments on criticisms of the management science paper "On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs," by William L. Maxwell. Maxwell presented an integer programming formulation for a one-machine job shop problem. The author contends that Maxwell's formulation was erroneous due to the intermediate steps leading from the original problem. He explains that the steps are not adequately described and therefore problematic. The author also explains that the counterexample to Maxwell's assessment is unable to be proven.

The article presents a zero-one linear program and a dynamic programming algorithm for finding the shortest route containing exactly q arcs from node 1 to node n in a network (N, A) with distances c(i, j). This note shows that the linear programming formulation and his extension based on it are defective, and that the dynamic programming algorithm can lead to suboptimal solutions, but a minor change in the dynamic programming formulation relieves the difficulty. A special feature of this linear program is that there can never be a loop in the basis, because the vectors corresponding to the variables of a loop are linearly dependent. The last comment is related to the dynamic programming algorithm. One is allowed to pass through a node more than once in the shortest route . The proposed method for solving this program consists of converting it into a shortest route problem containing exactly q arcs. But for some arbitrary reason, the dynamic program is formulated in such a way that one can never have starting node 1 more than once in the final solution.

This paper discusses the following model: (i) Arriving customers are accepted in the system in a time interval [t[sub0], t'] and are rejected with compensation after time t'; (ii) the server runs at the cost rate r[sub0] in a time interval [t[sub0], T], t[sub0]≤t' ≤ T, and runs at the increased cost rate r[sub1](r[sub1] > r[sub0]) after the closing time T, until the system becomes empty after time t'. The time t' is called the rejection time. The paper finds the optimal rejection time, that is, the rejection time that minimizes the expected total cost. It can be shown that in certain cases the optimal rejection time can be determined by a nonlinear equation. Numerical examples are given for an M/M/1 queuing system, and the more generalized model is briefly discussed. [ABSTRACT FROM AUTHOR]

The article presents a list of reference books related to operations research. Some of the books are: Managing the Resource Allocation Process; Modern Production Management; Mathematics in the Behavioral and Social Science; Progress in Operations Research, Volume III: Relationship between Operations Research and the Computer; Utility Theory for Decision Making; Local Government and Strategic Choice; Some Aspects of Queuing and Storage Systems; Modern Research for Administrative Decisions; The Challenge to System Design; Computerized Management Information Systems and Mathematical Analysis for Marketing Decisions.

This article presents a list of books related to operations research. Some of the books enlisted are--"Progress in Operations Research, Volume III: Relationship Between Operations Research and the Computer," by Julius S. Aronofsky; "Technological Forecasting and Long-Range Planning," by Robert U. Ayres; "Technology: Processes of Assessment and Choice," by Harvey Brooks; "Modern Production Management," 3rd. ed., by Elwood S. Buffa; "Systems Analysis Techniques," by Ralph Deutsch; "An Introduction to Mathematical Probability," by Martin Eisen; and "Operations Management: Selected Read," by Gene K. Groff and John F. Muth.

The article presents a list of books related to operations research. Some of the books included in the list are: "Organization and Administration of Research and Development," edited by N.H. Atthreya; "Operational Research, Models and Government," by W.T. Bane; "Motion and Time Study: Design and Measurement of Work," 6th ed. by Ralph M. Barnes; "Seasonality and Trends in Israel Tourism," by R.R.V. Baron; "Mathematical Programming in Practice," by E.M.L. Beale and "Dynamic Programming of Economic Decisions," by Martin J. Beckmann.

The article presents a list of books received for the September 1964 issue of the journal "Operations Research." Some of the books in the list include, "Sources of Information in Transportation," by Ruth F. Blaisdell, "Management Controls: New Directions in Basic Research," edited by Charles P. Bonini, Robert K. Jaedicke and Harvey M. Wagner, "Toward Better Situation of Scientific and Engineering Talent: A Program for Act," "The Random Character of Stock Market Price," edited by Paul H. Cootner, "Limited War and American Defense Policy," by Seymour J. Deitchman, "Operations Research Models for Business and Research," by Giuseppe M. Ferrero Di Roccaferrera, "Advances in Game Theory," edited by M. Dresher, L.S. Shapley and A.W. Tucker, "The Discrete Maximum Principle: A Study of Multistage Systems Optimization," by Liang-Tseng Fan and Chiu-Sen Wang, "Elements of Regional Accounts," by Webner Z. Hibsch and "Reliability Engineering for Electronic Systems," by Richard H. Myers, Kam L. Wong and Harold M. Gordy.

This paper provides the solution to the problem of the distribution of busy periods of the single-channel queue characterized by a time-dependent Poisson-distributed arrival rate and a general class of holding times. The notation is chosen in such a fashion that the main body of computations and mathematical analysis is identical with what was required in the solution of the general queuing equations considered in a previous paper which should be read first [4]. The solution of the problem for winch the traffic intensity is constant and the holding time distribution is Pearson type III is derived in closed form in terms of the Ink functions introduced previously. [ABSTRACT FROM AUTHOR]

Many methods have been developed to determine the proper reorder points and order quantities in an inventory system. These methods are based on a wide range of inventory models—from elementary deterministic models to sophisticated probabilistic models with time-varying parameters. This paper deals with two topics related to these calculations which were encountered during the design of an inventory control system for a firm in the heavy goods industry. A mathematical model is developed to describe the average annual variable cost of maintaining the inventory. Based on this model, the paper evaluates the savings obtained by using a simultaneous solution for reorder point and order quantity rather than a simpler separate solution. Then, this model is extended to describe the effect of batch withdrawals as a renewal process. The paper presents an adjustment which can be applied to the original reorder points based on unit withdrawals. Both of these topics are described in the context of a practical application. [ABSTRACT FROM AUTHOR]

Comments on a study by James M. Goodwin and Erich W. Giese that derived an expression for the probability that a given number of spares for each element of a complex system will be sufficient to ensure continued operation without requiring a spare when none is available. Error in their analysis; Consideration of an item obeying Poisson failure statistics with constant failure rate and repair time

Enumerates the practical operating considerations to be associated with the problems in order to achieve a real world applications in the use of probability estimates for management decision making. Emphasis that the probability estimates should be used by management in an independent manner; Case example to illustrate the utilization of the probability estimates by management; Comments on the remark by Healy.

The article comments on the article "A Heuristic Program for Locating Warehouses," by Alfred A. Kuehn and Michael J. Hamburger published in the July 1963 issue of the journal "Management Science." It remarks on the use of a heuristic method to determine warehouse location. While, as the writers point out, it has thus far only been tried in experimental situations, it should prove most useful as a beginning tool for estimating numbers and locations of warehouses. The method seems to add much to the linear programming methods thus far developed.

The problem of determining continuous flows of minimum cost in a network with convex cost functions is considered. The approach used is that of finding, for any given feasible flow, circuit flows of negative incremental costs. In the main theoretical result of this paper, it is proved that if at each stage, given a feasible nonoptimal flow X, the circuit flow with most negative incremental cost is added to X, linear convergence to the optimal solution will be obtained. In addition, this most negative incremental cost determines an upper bound on the difference in cost between the given feasible solution and the optimal. Based on these concepts, an algorithm, which preserves linear convergence, is presented to determine minimum cost flows in networks with convex costs in the arcs. Results of computer runs made for this algorithm are given. The special case of networks with linear costs is also considered. [ABSTRACT FROM AUTHOR]

Discusses abstract of research papers on operations research, published as of March 1962. 'In-Company Operations Research--A Case History,' by Foster L. Weldon; 'Analytical Aids for Program Planning,' by J.W. Pocock; 'Operations Research for Air Defense,' by Richard H. Blythe Jr.

In this paper the authors study the queues that build up in a minor stream of traffic waiting to cross or merge with a major stream The criterion for joining or crossing is that a gap between veincles in the major stream be greater than or equal to some constant value Several authors have studied the case where bulk service is provided for the minor stream queue with the appearance of each gap, in this paper the authors emphasize the higher flow rate situations where one car in the minor stream queue is released in a first-come first-serve fashinon with the appearance of a gap It is assumed that the minor stream is Poisson-fed while the intervehicle headways inq the major stream are arbitrary but identically and independently distributed random variables. [ABSTRACT FROM AUTHOR]

The article provides information on the program of the Eighteenth National Meeting of the Operations Research Society of America held in Detroit, Michigan from October 10 to 12, 1960. Thomas Killian of the Office of Naval Research delivered his keynote address in the first day. Many papers were presented as part of the meeting. In his paper, J. E. Mulligan stated a basic management problem in war gaming projects. Other topics discussed at the meeting include military operations research, logistics, management control systems, and information retrieval.

The article presents information on the program of the Seventh Annual Meeting of the Operations Research Society of America held in Washington, D.C. in 1959. There were many papers presented during the meeting. A. R. Marks presented his paper which discusses the testing of alternate work schedules and procedures for large-scale job-shop operations. Other topics discussed at the meeting include integrated materials management simulation, concepts in decision making, and productivity measurement in engineering design.

The article presents the report of the president of the Operations Research Society of America (ORSA) in the U.S. to the membership. He outlines the problems and activities of the society including the amendment to eliminate associate membership, affiliation with the division of mathematics of the national research council, commemorative plaque for the Lanchester prize, consideration of employment of full-time staff member, quality of presentations at ORSA meetings, plans for an international conference on operations research and management sciences and participation in management of the society by members from industry.

With fluctuating sales, a manufacturer must have fluctuating production, or fluctuating inventory, or both Penalties are associated with either type of fluctuation Several papers place this problem into a conventional linear-programming framework This paper suggests that the same problem may be placed into a transportation-method framework and, further, that many transportation problems may be extended to include multiple time periods where this is meaningful A generalized scheduling problem is placed here into the standard form of the transportation table [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to delineate an algorithm for fractional programming with nonlinear as well as linear terms in the numerator and denominator. The algorithm presented is based on a theorem by Jagannathan [7] concerning the relationship between fractional and parametric programming. This theorem is restated and proved in a somewhat simpler way. Finally, it is shown how the given algorithm can be related to the method of Isbell and Marlow [6] for linear fractional programming and to the quadratic parametric approach by Ritter [10]. The Appendix contains a numerical example. [ABSTRACT FROM AUTHOR]

This paper reports some research, ideas, and theory about managerial decision making. The first research projects dealt with are aggregate production and employment scheduling. From this is developed the idea that management's own (past) decisions can be incorporated into a system of improving their present decisions. Decision rules are developed, with the coefficients in the rules derived from management's past decisions (rather than from a cost or value model). Half a dozen test cases are used to illustrate and test these ideas (theory). Some rationale about decision making in organizations and criteria surfaces is supplied to help interpret the major ideas presented. [ABSTRACT FROM AUTHOR]

Commentary is presented for an article published in the July 1960 issue of "Management Science," written by L. V. Kantorovich with an introductory note by T. C. Koopmans. According to the author, in his introduction Koopmans addresses in particular a linear programming problem and a matrix game presented by Kantorovich. Also presented is an interpretation of the article's treatment of decision variables and mathematical optimization. The author notes that the article presents algorithms that have been improved from their contemporary presentations.

The article reports on key issues relevant to the use of statistical techniques by middle management. A group of student economists taking the statistics course of the Executive Program of the University of Chicago during 1952, 1953, and 1954 were required by their professor, W. Allen Wallace, to turn in a term paper analyzing the effect communication patterns have upon the operation of groups. The author focuses on examining the information compiled from the term papers, including general problems that the students observed as well as inefficiencies generated in eight specific categories including business forecasting, predictive techniques, and scheduling and inventory control. Marketing techniques are called into question. Common mistakes made in the interpretation of data are also discussed.

Presents several books on operations research. "General Competitive Analysis," by Kenneth J. Arrow and F. H. Hahn; "Economic Theory and Operations Analysis," Third edition, by William J. Baumol; "The Design of Inquiring Systems," by C. West Churchman; "Power and Money," by Charles P. Kindleberger.