摘要:

AbstractMost inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational resu

ISSN:0028-1441    

DOI:10.1002/nav.3800210302

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractIn multi‐commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two‐commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1+ K2, This paper considers a two‐commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering

ISSN:0028-1441    

DOI:10.1002/nav.3800210303

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractSuppose that the state of a queueing system is described by a Markov process { Yt,t≥ 0}, and the profit from operating it up to a timetis given by the functionf(Yt). We operate the system up to a time T, where the random variable T is a stopping time for the process Yt. Optimal stochastic control is achieved by choosing the stopping timeTthat maximizesEf(YT) over a given class of stopping times. In this paper a theory of stochastic control is developed for a single server queue with Poisson arrivals and general service time

ISSN:0028-1441    

DOI:10.1002/nav.3800210304

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractAn optimal schedule for checking an equipment subject to failure which can be detected by inspection only, is derived. Increasing failure rate and one percentile specify the otherwise unknown life distribution. Dynamic programming methodology yields the solution which minimizes the maximum expected cost. Numerical examples are presented and compared with models employing differing amounts of knowledge.

ISSN:0028-1441    

DOI:10.1002/nav.3800210305

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractIn this paper the effects of inspector error on a cost‐based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error‐free and error‐prone inspection procedures and some comparisons are

ISSN:0028-1441    

DOI:10.1002/nav.3800210306

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit,N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix.C*, to which the so‐called transportation paradox does not apply. The general Hitchcock solution usingC* gives the costT*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value ofNu, the unboundedNfor minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution usingC* can provide the general answer, (d) how the results may be modified to apply to problems with fixedN, and hence (e) to determine the function of the decreasingTasNapproachesNu, and finally (f) to provide a treatment when the supplies at originiand/or the demands at destinationj, are bounde

ISSN:0028-1441    

DOI:10.1002/nav.3800210307

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800210308

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper proposes the use of a set of simultaneous, modified Cobb‐Douglas production functions to determine the “best” mix of aircraft inputs (men, spare parts, support equipment, etc.) to achieve certain levels of output. The simultaneous equations are “solved” by the use of proxy values in an iterative search process. Tests of this production function model indicate that real world data fits quite well (R2ranges from 0.884 to 0.951) and the residuals do not appear to have any significant bias.The aircraft production functions for several types of aircraft (F‐4, A‐7, A‐6, A‐4) have been maximized for a fixed budget and specific constraints. A potential increase in output of up to 10 percent appears possible. In general the marginal value of spare parts surpasses

ISSN:0028-1441    

DOI:10.1002/nav.3800210309

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.

ISSN:0028-1441    

DOI:10.1002/nav.3800210310

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed.

ISSN:0028-1441    

DOI:10.1002/nav.3800210311

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY