Search

An original procedure for the determination of the optimum value of tool life criterion of cutting tools tooled with throw-away carbide tips is described in this paper. The procedure has the character of an iterative method, on the basis of which one can reach the optimum value of tool life criterion with respect to attaining the minimum machining cost. The algorithm of the given method is represented in a bar chart, where we can see two calculation cycles, their purpose and other relationships. A practical example closes the paper. [ABSTRACT FROM AUTHOR]

This paper discusses the problem at assigning facilities to locations. Several optimal and sub-optimal-yielding algorithms are discussed mentioning their desirable and undesirable features. A new heuristic algorithm is proposed. The proposed algorithm, combining features from other well known models, and programmed in Fortran IV is tested against existing methods. The results show that the algorithm is efficient, easy to run and is very competitive with other well-known methods. [ABSTRACT FROM AUTHOR]

This paper investigates the classical n-job, M-machine flow-shop scheduling problem under the assumption that jobs are processed on all machines in the same order. Based on the heuristic job-pairing technique and the decomposition strategy, a heuristic decomposition algorithm is developed which will generate at least a near-optimal schedule for the flow-shop scheduling problem. The proposed algorithm is compared to the existing decomposition approach and is found to be superior to Ashour's decomposition algorithm, both in increased solution quality and decreased computational time required to solve the problem. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present a generalized and a special purpose method for the evaluation of throughput time. The general method presented represents a modification of Mason's Rule to a special ease of flow evaluation encountered in production operations. The algorithm presented is for the special model wherein there is a single output and wherein all possible feedbacks are permissible. It is anticipated that the methods presented will aid greatly in the evaluation and understanding of throughput time. The methods should be equally applicable to normal manufacturing operations and to special major project type activities. Clearly the application of the methods is limited only by one's ability to establish the flow graph, the times for the operations and the yields for the various flows. [ABSTRACT FROM AUTHOR]

Mathematicians have long amused themselves with very difficult problems that are treated as puzzles. One of the more recent of these is the travelling-salesman problem. During last two decades several methods have been developed for solving the travelling-salesman problem, which is akin to many other important problems. The problem of determining a manufacturing schedule, when a number of products are to be manufactured over a production facility, is identical to the travelling-salesman problem. This paper discusses a simple approach to the solution of such production scheduling problems. [ABSTRACT FROM AUTHOR]

This paper offers a heuristic algorithm for the allocation of resources both in physical space and in time. The algorithm, to be implemented by a computer, will seek out good, if not optimum, combinations of items, namely, schedules and arrangements with respect to more than one payoff function. The algorithm has application in such diverse fields as the time scheduling budget allocations, courses of study in training programs, transportation, interdependent projects, and allocation in two or three dimensional space of production, service and/or warehousing facilities. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper extends the current state of public facilities location problems on a road network to cover situations in which the number of users at each node may be a random variable. The basic location model is reformulated as a chance-constrained programming problem with fractile criterion. A computational procedure for solving the non-linear deterministic equivalent problem derived is presented. Finally, a hypothetical numerical example illustrates the possibility of changes in the location decision when the stochastic nature of the problem is taken into account. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The author [1], [2] has given an algorithm for finding that stratified allocation which minimizes the posterior variance of the overall population mean subject to a budget constraint under a model in which a normal prior distribution and independent normal sampling distributions were assumed. The budget constraint assumed a variable per unit cost of observation. In the present paper these results are extended to cover the case where there are fixed costs, as well as variable costs, associated with sampling in the ith stratum. The resulting algorithm is noted to be applicable in finding the optimal allocation of sampling effort (with fixed and variable sampling costs) under a variety of distributional assumptions. An interpretation is also given to two and higher stage design questions when there is differential prior information regarding the first stage units. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The process of designing the tool layout for a single spindle multi-station automatic chucking lathe has been analysed and formulated as a set of algorithms which enable the process to be performed automatically on a digital computer. A simple, cheap and natural means of communication between the design office and the computer has been designed, and the computer output has been arranged to convey the resulting information clearly by means of layout drawings for each station and of tabulated operating data. The procedures developed should be of great value to machine tool manufacturers, particularly at the quotation stage, and to companies possessing such machines. [ABSTRACT FROM AUTHOR]

Easily manipulated list structures for recording the basis tree for adjacent extreme point (“simplex type”) network algorithms are paramount to the development of computationally efficient network algorithms. This paper presents a new list structure which is shown to be computationally more efficient and to require one-third less computer memory to implement than all alternate list structures. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The purpose of this paper is to present the theory and develop an algorithm associated with the exploration of a dual response surface system. The approach is to find conditions on a set of independent or "design" variables which maximize (or minimize) a "primary response" function subject to the condition that a "constraint response" function takes on some specified or desirable value. A method is outlined whereby a user can generate simple two dimensional plots to determine the conditions of constrained maximum primary response regardless of the number of independent variables in the system. He thus is able to reduce to simple plotting the complex task of exploring the dual response system. The procedure that is used to generate the plots depends on the nature of the individual univariate response functions. In certain situations it becomes necessary to apply the additional constraint that the located operating conditions are a certain "distance" from the origin of the independent variables (or the center of the experimental design). The methods derived and discussed in the paper are applicable only to quadratic response functions. [ABSTRACT FROM AUTHOR]

A number of criteria have been proposed for selecting the best subset or subsets of independent variables in linear regression analysis. Applying these criteria to all possible subsets is, in general, not feasible if the number of variables is large. Many of the criteria are monotonic functions of the residual sum of squares of hence the problem is reduced to identifying subsets for which this quantity is small. In an earlier paper (Selection of the Best Subset in Regression Analysis by R. R. Hoeking and R. N. Leslie, 1967) a method was described for identifying such subsets without considering all possible subsets. Howerver, the amount of computation required if more than fifteen independent variables were considered was excessive. The present paper extends the basic ideas in that paper so that moderately large problems can how be treated with what appears to be a minimum of computation. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper describes several algorithms for computing the residual sums of squares for all possible regressions with what appears to be a minimum of arithmetic (less than s x floating-point operations per regression) and shows how two of these algorithms can be combined to form simple leap and bound technique for finding the best subsets without examining all possible subsets. The result is a reduction of several orders of magnitude in the number of operations required to find the best subsets. [ABSTRACT FROM AUTHOR]

This paper presents the algorithm "DETMAX" whose purpose is to construct experimental designs that are "D-optimal," These are designs for which the determinant of X'X is maximum, where X is the "matrix of independent variables" in the usual linear model y = Xβ + ε. Although the algorithm does not guarantee D-optimality, it has performed well in many cases where D-optimal designs are known. Five examples are given, illustrating the use of DETMAX to construct designs "from scratch" and to augment existing data. A FORTRAN listing is available on request. [ABSTRACT FROM AUTHOR]

Tendencies for the voivodships of Poland to group into similar economic types is considered by means of a principal components analysis and a grouping algorithm. Data are taken on 1958 and 1964. In both years four basic dimensions accounted for nearly three-fourths of the total variance, These dimensions include 1) an agricultural factor, 2) a heavy industrial factor, 3) a socialized economy factor, and 4) an industrial growth dimension. These dimensions are used to group the voivodships into a system of regional types based on the degree of industralization and the agrarian characteristics, especially the degree of socialization of agriculture Changes in the voivodships over the six year period are noted. [ABSTRACT FROM AUTHOR]

In this paper it is assumed that, using a sample survey, two factors are to be studied, comparisons between the "levels" of the factors are of greatest interest, and there is "interaction" between the factors. Attention is concentrated on situations in which only two levels of each factor are to be compared, but extensions to more complex surveys are discussed. Assuming independent sampling, optimal sample size allocations are obtained. Where these allocations require recourse to programming algorithms, approximate solutions are given. If independent sampling is not feasible, a double sampling procedure is suggested. To indicate how sub-sampling from the first phase sample is to be carried out, a sampling rule (possessing optimal conditional precision properties) is derived. Then, a procedure to determine the optimal first phase sample size is given. Finally, it is demonstrated that this double sampling procedure can be applied to estimation of the (finite) population mean when double sampling with stratification is used. [ABSTRACT FROM AUTHOR]

An algorithm for the determination of the economic design of X-charts based on Duncan's model is described in this paper. This algorithm consists of solving an implicit equation in design variables n (sample size) and k (control limit factor) and an explicit equation for h (sampling interval). The use of this algorithm not only yields the exact optimum but also provides valuable information so that the sensitivity of the optimum loss-cost (L*) can be evaluated. Loss-cost contours are used to discuss the nature of the loss-cost surface and the effect of the design variables. The effect of two parameters, the delay factor (e), and the average time for an assignable cause to occur (1/lambda), on the optimum design is evaluated. Numerical examples are used for illustrations. [ABSTRACT FROM AUTHOR]

This paper is devoted to a discussion of an iterative procedure for obtaining the maximum likelihood estimator of the covariance matrix for multivariate experiments in which measurements on certain components of a normal vector random variable are intentionally omitted in corresponding subgroups of the experimental units. The proposed algorithm, which is based on the Newton-Raphson method, is outlined in detail in Section 5. A special design is included to illustrate the procedure and a few areas of application are indicated. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Examines the multiplication scheme based on variable bitshift for negative binary numbers. Use of the negative binary adder-subtracter; Description of algorithms for basic arithmetic operations in a general negative base; Illustration of the algorithm for the multiplication of two numbers.

Extensions of Yates' algorithm (1937) for the analysis of variance of 2[sup n] experiments have been described by many authors but for some reason the general method docs not appear to be particularly well known. The purpose of this paper is to bring together the various extensions, and to present a unified account of the method. This method is particularly useful as the main pang of a general computer program for analysis of complete factorial experiments. [ABSTRACT FROM AUTHOR]

A direct covariance algorithm is presented for handling problems of component tolerance analysis and random input variations with a particular emphasis for utilization in computer-aided statistical electronic circuit design. It is shown that this result is applicable to a wide range of electronic circuit arrays having non-linear components. Moreover, a systematic procedure is developed for predicting in advance the expected accuracy.
Numerical results comparing the direct covariance algorithm with up to 1000 Monte Carlo ensemble-averaged computer runs are provided. Contrary to popular belief, errors of 10 to 25% are obtained by using 25 to 100 Monte Carlo runs. Improvements in both accuracy and computational speed clearly demonstrate that the direct covariance algorithm is a versatile and effective computer-aided design tool. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The question of how the well-known Neyman stratified allocation result generalizes when it is formally assumed that there is prior information concerning the unknown stratum means is dealt with here. This prior information is taken to be expressible in the form of a multivariate normal prior distribution. Several methods of assessing prior distributions are discussed. The allocation for stratified sampling is shown to be a special case of a more general allocation problem. A computational algorithm is presented for this more general problem of finding the allocation of sampling effort which minimizes the posterior variance of any given linear combination of unknown normal process means subject to a budget constraint. A feature of the solution is that for limited budgets one may rely solely on his prior information concerning some strata, sampling only in a subset of the strata. Finally, several applications are briefly described including a "non-Bayesian" solution to a particular problem of allocation for a multipurpose stratified sample. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)