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.)
ALGORITHMS, RESOURCE allocation, FACILITIES, PLANT layout, LOCATION analysis, FORTRAN IV, MATHEMATICAL models, OPERATIONS research
Abstract
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]
PRODUCTION scheduling, COMMERCIAL agents, FACTORS of production, PRODUCTION (Economic theory), ALGORITHMS, MATHEMATICAL models, TRAVELING salesman problem
Abstract
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]
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.)
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]