摘要:

Reducing the customer's risk of down time is becoming increasingly important in the support of industrial and consumer durable equipment, whether sold or leased. Traditionally, improved support has meant improvements in diagnosis, repair, and spare part availability. However, these approaches eventually have diminishing returns. In many cases, dedicated loaners can be cost effective in eliminating or reducing down time. In this paper, models are developed to examine the trade-offs involved in decisions about loaners. Alternative loan policies are discussed, and the application of these policies is illustrated.

ISSN:0740-817X    

DOI:10.1080/05695558308974607

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

A method is presented for determining an optimum sequencing inspection plan for a group of inspectors operating at different skill and cost levels. Production and inspection costs for both accepted and rejected items are considered, and dependencies among successive inspections are permitted. A branch-and-bound technique is used to determine the optimum plan. Results are demonstrated by a numerical example.

ISSN:0740-817X    

DOI:10.1080/05695558308974608

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

Sequential Bayesian work sampling has been previously shown to be both more efficient and more adaptable than traditional methods of work sampling. However, a few deficiencies of the Bayesian approach remained. The advances to that methodology shown here greatly reduce or eliminate those deficiencies. These advances include beta parameter maps, confidence subinterval estimation in closed form, preposterior analysis, estimation methods for remaining sample sizes, and other aids to the management of Bayesian work-sampling studies.

ISSN:0740-817X    

DOI:10.1080/05695558308974609

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

This paper presents an efficient algorithm for the general (as opposed to the binary) knapsack problem. The algorithm generates tight bounds on the variables from the LP relaxation of the problem which give the optimal values of most of the variables very quickly. A branch-and-bound procedure is then employed to solve the remaining reduced problem. Extensive computatonal tests have confirmed the efficiency of this approach for a wide variety of problems with as many as 5000 variables.

ISSN:0740-817X    

DOI:10.1080/05695558308974610

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

Packing problems in general constitute a difficult set of problems which still defy solution The determination of bounds on the solution of such problems can, however, provide insight concerning the problem and can help in the development of new solution procedures. This paper, Part I, develops some bounds on the density of packing mixed discs on a circular plate. A methodology is proposed which formulates the problem as a linear program and requires the generation of feasible packings. The procedure for testing feasible packings, the solution algorithm, and results of experimentation are discussed in Part II, to appear in the next issue.

ISSN:0740-817X    

DOI:10.1080/05695558308974611

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

When demand is less than plant capacity, aggregate production and demand can be matched by (1) throttling production at a rate equal to demand or (2) producing at capacity production rates and shutting down periodically to reduce inventories. In some plants several levels of shutdown are feasible. For example, a first level of shutdown may involve only equipment, while a second level of shutdown may involve shutting down equipment and laying off workers. Moreover, when a plant has multiple production lines, each line can be throttled or periodically shut down. This paper uses classical optimization techniques to develop optimal production strategies for plants with multiple shutdown levels and multiple, identical production lines.

ISSN:0740-817X    

DOI:10.1080/05695558308974612

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

This paper addresses the problem of lot sizing within an acyclic hierarchical multiperiod production system. Cost conditions are established for the existence of optimal schedules satisfying the Wagner-Whit in property and a generalized nested schedules property. The method of proof is constructive and based on a network model. Imbedded in the proof are algorithms for adjusting any solution so that it satisfies the properties; thus the algorithms can be used to obtain a locally optimum solution from any trial schedule.

ISSN:0740-817X    

DOI:10.1080/05695558308974613

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

In Part I, a framework for the analysis and measurement of productivity was provided, along with a sample of some empirical findings obtained with this framework. In this paper, the array of factors which must be examined in order to account for the observed findings is reviewed. Problems encountered in the application of this framework in different kinds of plants are discussed, including problems with the development of managerial ability to interpret the results of the analysis.

ISSN:0740-817X    

DOI:10.1080/05695558308974614

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

In teaching the use of mathematical modeling in the Industrial Engineering area, one is often faced with situations where the decision variable is restricted to a few discrete values. In such circumstances I have found it pedagogically advantageous to use the concept of indifference curves, i.e., curves in a suitable two-dimensional space showing under what conditions we are indifferent between neighboring values of the decision variable. This note illustrates the use of indifference curves in a particular inventory control model.

ISSN:0740-817X    

DOI:10.1080/05695558308974615

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

Two different lower bounds on the objective values of certain location problems have recently been proposed. Such bounds are useful for finite termination of an algorithm. It has been previously established that one of these bounds is superior to the other. Here we present some extensions and prove that a generalized version of the result is also true.

ISSN:0740-817X    

DOI:10.1080/05695558308974616

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor