ISSN:0160-5682    

DOI:10.1057/jors.1983.233

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractSince the late 1950s, much work has been done on developing models of manpower systems which may be used for the purposes of planning. Many organizations have made successful use of such models, but in spite of these successes, manpower planning models are only gradually coming into widespread use. The aim of this paper is to review the models which have been developed, concentrating on their assumptions and applications rather than on mathematical or statistical details. A common theme of successful applications is that good presentation of results and ease of use are more important to users than theoretical sophistication.

ISSN:0160-5682    

DOI:10.1057/jors.1983.234

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractThis paper describes an O.R. approach designed to assist management in the task of identifying and subsequently quantifying potential areas for improvement in the effectiveness of maintenance. It is argued that the information commonly collected and made available to management is inadequate when compared against the true information requirements associated with this process. A survey technique incorporating the collection and analysis of subjective data was designed as a means by which to overcome this shortcoming. This approach is described within the context of two industrial case studies. The results obtained from the case studies are discussed in detail, together with problems which arose in practice with regard to the design and implementation of the methods described.

ISSN:0160-5682    

DOI:10.1057/jors.1983.235

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractThis note discusses experiences in running discrete-events simulation models on an Apple II microcomputer. The use of PASCAL as a simulation language is commented on. To give an indication of the type of simulations that can be run on a micro, a fairly complex model relating to icebreaking operations is discussed. Run times for this model are mentioned. It is indicated how those run times can be reduced by programming part of the random number generation in assembly language. The conclusion is that significant simulation work can be done on a small micro like the Apple II.

ISSN:0160-5682    

DOI:10.1057/jors.1983.236

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractA linear goal programming model for planning the exports of emerging countries is formulated in this paper. The model includes some economic factors which may affect the exports, e.g. industrial structure, labour force, value added in exports, capital efficiency, imports of raw material used for manufacturing goods designated for exports, investment plan, etc. An illustrative example is presented. A sensitivity analysis was performed in order to examine the effect of various changes made in the model on the results. It is felt that the model presented in this study would be useful to economic planners in emerging countries.

ISSN:0160-5682    

DOI:10.1057/jors.1983.237

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractThis paper presents a new approach to evaluating classification procedures experimentally in human service organizations. Methods of design and analysis are proposed which answer the major objections to designed experiments with human subjects and which are suited to the special character of the classification problem. One important feature of the approach recommended here is the use of EVOP, a methodology originally developed for use in industrial production facilities, which allows methods of experimental design to be applied even where variation must be restricted. It is also shown that constrained mixture designs, rather than ordinary designs such as factorials, form the appropriate class of experimental designs for use in this problem. The example of assignment of prison inmates to minimum and maximum security is used to clarify the presentation and to demonstrate the practical implications of the proposed approach.

ISSN:0160-5682    

DOI:10.1057/jors.1983.238

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractThe periodic reviews of parliamentary constituencies in Great Britain require the Parliamentary Boundary Commission in each country to propose any necessary changes in order that constituencies shall be as near the electoral quota (i.e. the average electorate per constituency) as possible, within certain constraints. For each unit (county, London borough etc.) with which they work, the number of potential solutions to their problem is very large. This paper describes a computer program that can be used to inform the Commission about all those solutions, so improving the information base from which they select the new set of constituencies.

ISSN:0160-5682    

DOI:10.1057/jors.1983.239

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractThe payment conditions for the purchase of raw materials and components have received little attention in the literature on inventory control. A common practice is to require payment by some specific day of the month following the month of delivery rather than a fixed time period after delivery. Alternatively, for convenience, invoices for a particular supplier may always be dealt with on the same day of the month, regardless of the payment conditions. In such circumstances the classical square root E.O.Q. is not the‘optimal’size for purchase orders. Under the assumption of a roughly constant demand rate for the final products, as is assumed for lot sizing techniques in most statistical inventory control models, it is shown that orders should be specified as a number of integral months' demands. For those items whose annual purchase bill is over about£500 per year, the minimum cost purchase order should be one month's demand, to be delivered as early in the month as possible or in convenient sub-lots.This new model will not lead to large savings on the use of the E.O.Q. lot size. It is however claimed that this fits the practical situation better and avoids many of the nonsenses of the E.O.Q. of, for example, giving absurdly low order sizes for high priced items, and the need to place lower bounds on order sizes.

ISSN:0160-5682    

DOI:10.1057/jors.1983.240

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractIn previous work, Erickson and Luss examined the problem of optimally sizing computer records so as to minimize wasted space. They assumed that a fixed number of record sizes can be used to store messages of various lengths. If a message cannot be stored in any single record, it is stored in multiple records of the same size. However, the record size used to accommodate divided messages is not used to store any message that fits into any of the other record sizes. Here, we relax the latter constraint and allow the record size designated to store divided messages to store also other messages. A dynamic programming algorithm that finds the optimal record sizes is presented. However, since the computational effort needed to find the optimal record sizes is large, we also derive bounds for the optimal solution and give a heuristic algorithm that provides near optimal solutions.

ISSN:0160-5682    

DOI:10.1057/jors.1983.241

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor

摘要:

AbstractGiven a set of sources with known capacities and a set of users with known demands for a product, the objective is to minimize the cost of assigning the users to the sources. The restrictions are that each user's demand is satisfied by exactly one of the sources, and that the total amount assigned to each source does not exceed its capacity. A fixed-charge version of this problem is formulated as a set partitioning problem and solved by a column-generating branch and bound procedure. Computational results are given.

ISSN:0160-5682    

DOI:10.1057/jors.1983.242

出版商:Taylor&Francis    

年代:1983

数据来源: Taylor