摘要:

In this paper, a probabilistic reorder point inventory model with (s, qp) system is developed, when the items in inventory are subject to constant rate of deterioration. To illustrate the results of the mathematical model developed, an example is also given.

ISSN:0020-7543    

DOI:10.1080/00207547808929994

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

This paper develops a general [>Q, r) single item model, based on the usual assumptions of stationary, normally distributed probabilistic demand, but covering simultaneously all three types of shortage costs commonly dealt with in the literature; namely shortage costs proportional to the number of units short and to the duration of the shortage, or proportional to the number of units short, or proportional to the number of stockout occasions. The model considers that the item stocked is subject to throe different uses, each being linked with the different type of shortage cost.

ISSN:0020-7543    

DOI:10.1080/00207547808929995

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

This article deals with the effect of the sampling interval on the precision of systematic activity sampling, and models for medium and large sampling intervals are developed. The problem of poor precision due to possible cyclic properties of the process is also analysed, and a necessary criterion for non-interference is derived.

ISSN:0020-7543    

DOI:10.1080/00207547808929996

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

The plant layout problem is an important industrial problem that remains unsolved. Seppanen and Moore considered an important subproblem: that of the optimal specification of which facilities are to be adjacent in the final layout without regard to the area or shape of the individual facilities. They present a string processing heuristic which relies on using a test for graph planarity. This paper further develops their graph theoretic formulation of the problem. This development is used to present two procedures which usually yield near-optimal solutions. The procedures circumvent the considerable difficulty of graph planarity testing by working entirely within a family of graphs known to be planar and also to contain the solution. Ways of improving suboptimal solutions are discussed. Computational experience in using the methods on a variety of problems suggests that the methods are efficient.

ISSN:0020-7543    

DOI:10.1080/00207547808929997

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

Developments in the course of this century regarding human work, views in question, job redesign (job enrichment and the like) and relative research are described.

ISSN:0020-7543    

DOI:10.1080/00207547808929998

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

This paper discussed methods of estimation of cutting tool quantum required for serial processing of a set of work pieces: (1) at a particular work point, mid (2) in two alternative cases associated with automatic lines. The first case covers failure to replace single cutting tools, while the second variant handles simultaneous replacement of all cutting tools after a certain working time, -By introduction of cost, the optimum replacement time is made determinable, i.e. it is possible to estimate the number of tools required to process a defined quantity of work pieces at the observed operation point,

ISSN:0020-7543    

DOI:10.1080/00207547808929999

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

To be successful in mechanized assembly, one has to realize that it is an attempt to replace, by a mechanical device, the skill and judgement of a human assembler. Although a low value of operator involvement can be achieved, complete non-involvement is not economically viable. This is owing to the high cost of sophisticated devices necessary to take complete account of the faults which can occur due to random combinations of system accuracy and component quality.

ISSN:0020-7543    

DOI:10.1080/00207547808930000

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

Consider scheduling n independent, single operation jobs, all available at time zero, on m identical processors. Further, assume that each job must be processed by exactly one of these processors, and it is desired to minimize makespan. This paper reports a computationally efficient procedure for treating this problem, which utilizes human ingenuity to improve on a traditional solution procedure. Computational experience with the procedure indicates that good solutions to large problems are easily obtained; in fact out of 240 test problems, the optimal solution was found in every case. The entire procedure is simple enough for a shop foreman to be able to solve large problems by hand.

ISSN:0020-7543    

DOI:10.1080/00207547808930001

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

摘要:

The problem of scheduling n jobs on m parallel identical processors is studied. It is shown that an algorithm previously considered to be optimal is not so. Next, n modified approach is proposed and its limitations are examined.

ISSN:0020-7543    

DOI:10.1080/00207547808930002

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor

ISSN:0020-7543    

DOI:10.1080/00207547808930004

出版商:Taylor & Francis Group    

年代:1978

数据来源: Taylor