|
1. |
Storage problems when demand is “all or nothing” |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 529-538
D. P. Gaver,
P. A. Jacobs,
Preview
|
PDF (429KB)
|
|
摘要:
AbstractAn inventory of physical goods or storage space (in a communications system buffer, for instance) often experiences “all or nothing” demand: if a demand of random sizeDcan be immediately and entirely filled from stock it is satisfied, but otherwise it vanishes. Probabilistic properties of the resulting inventory level are discussed analytically, both for the single buffer and for multiple buffer problems. Numerical results are presen
ISSN:0028-1441
DOI:10.1002/nav.3800270402
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
2. |
Reliability growth of repairable systems |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 539-547
Stephen A. Smith,
Shmuel S. Oren,
Preview
|
PDF (572KB)
|
|
摘要:
AbstractThis paper considers the problem of modeling the reliability of a repairable system or device that is experiencing reliability improvement. Such a situation arises when system failure modes are gradually being corrected by a test‐fix‐test‐fix procedure, which may include design changes. A dynamic reliability model for this process is discussed and statistical techniques are derived for estimating the model parameters and for testing the goodness‐of‐fit to observed data. The reliability model analyzed was first proposed as a graphical technique known as Duane plots, but can also be viewed as a nonhomogeneous Poisson process with a particular mean value
ISSN:0028-1441
DOI:10.1002/nav.3800270403
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
3. |
On the distribution of the optimal value for a class of stochastic geometric programs |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 549-571
Paul M. Ellnert,
Robert M. Stark,
Preview
|
PDF (1231KB)
|
|
摘要:
AbstractAn approach is presented for obtaining the moments and distribution of the optimal value for a class of prototype stochastic geometric programs with log‐normally distributed cost coefficients. It is assumed for each set of values taken on by the cost coefficients that the resulting deterministic primal program is superconsistent and soluble. It is also required that the corresponding dual program has a unique optimal point with all positive components. It is indicated how one can apply the results obtained under the above assumptions to stochastic programs whose corresponding deterministic dual programs need not satisfy the above‐mentioned uniqueness and positivity requireme
ISSN:0028-1441
DOI:10.1002/nav.3800270404
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
4. |
A class of continuous nonlinear programming problems with time‐delayed constraints |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 573-588
Thomas W. Reiland,
Morgan A. Hanson,
Preview
|
PDF (652KB)
|
|
摘要:
AbstractA general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example.
ISSN:0028-1441
DOI:10.1002/nav.3800270405
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
5. |
Equalities in transportation problems and characterizations of optimal solutions |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 589-595
Kenneth O. Kortanek,
Maretsugu Yamasaki,
Preview
|
PDF (304KB)
|
|
摘要:
AbstractThis paper considers the classical finite linear transportation Problem (I) and two relaxations, (II) and (III), of it based on papers by Kantorovich and Rubinstein, and Kretschmer. Pseudo‐metric type conditions on the cost matrix are given under which Problems (I) and (II) have common optimal value, and a proper subset of these conditions is sufficient for Problems (II) and (III) to have common optimal value. The relationships between the three problems provide a proof of Kantorovich's original characterization of optimal solutions to the standard transportation problem having as many origins as destinations. The result are extended to problems having cost matrices which are nonnegative row‐column equival
ISSN:0028-1441
DOI:10.1002/nav.3800270406
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
6. |
A network flow approach for capacity expansion problems with two facility types |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 597-608
Hanan Luss,
Preview
|
PDF (636KB)
|
|
摘要:
AbstractA deterministic capacity expansion model for two facility types with a finite number of discrete time periods is described. The model generalizes previous work by allowing for capacity disposals, in addition to capacity expansions and conversions from one facility type to the other. Furthermore, shortages of capacity are allowed and upper bounds on both shortages and idle capacities can be imposed. The demand increments for additional capacity of any type in any time period can be negative. All cost functions are assumed to be piecewise, concave and nondecreasing away from zero. The model is formulated as a shortest path problem for an acyclic network, and an efficient search procedure is developed to determine the costs associated with the links of this network.
ISSN:0028-1441
DOI:10.1002/nav.3800270407
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
7. |
Solving multifacility location problems involving euclidean distances |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 609-620
Paul Calamai,
Christakis Charalambous,
Preview
|
PDF (551KB)
|
|
摘要:
AbstractThis paper considers the problem of locating multiple new facilities in order to minimize a total cost function consisting of the sum of weighted Euclidean distances among the new facilities and between the new and existing facilities, the locations of which are known. A new procedure is derived from a set of results pertaining to necessary conditions for a minimum of the objective function. The results from a number of sample problems which have been executed on a programmed version of this algorithm are used to illustrate the effectiveness of the new technique.
ISSN:0028-1441
DOI:10.1002/nav.3800270408
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
8. |
An easy solution for a special class of fixed charge problems |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 621-624
Patrick G. McKeown,
Prabhakant Sinha,
Preview
|
PDF (207KB)
|
|
摘要:
AbstractThe fixed charge problem is a mixed integer mathematical programming problem which has proved difficult to solve in the past. In this paper we look at a special case of that problem and show that this case can be solved by formulating it as a set‐covering problem. We then use a branch‐and‐bound integer programming code to solve test fixed charge problems using the setcovering formulation. Even without a special purpose set‐covering algorithm, the results from this solution procedure are dramatically better than those obtained using other solution pro
ISSN:0028-1441
DOI:10.1002/nav.3800270409
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
9. |
The bounded interval generalized assignment model |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 625-633
G. Terry Ross,
Richard M. Soland,
Andris A. Zoltners,
Preview
|
PDF (464KB)
|
|
摘要:
AbstractThe bounded interval generalized assignment model is a “many‐for‐one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources‐to‐uses transportation model are als
ISSN:0028-1441
DOI:10.1002/nav.3800270410
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
10. |
The M/G/1 queue with instantaneous bernoulli feedback |
|
Naval Research Logistics Quarterly,
Volume 27,
Issue 4,
1980,
Page 635-644
Ralph L. Disney,
Donald C. McNickle,
Burton Simon,
Preview
|
PDF (521KB)
|
|
摘要:
AbstractIn this paper we are concerned with several random processes that occur inM/G/1queues with instantaneous feedback in which the feedback decision process is a Bernoulli process. Queue length processes embedded at various times are studied. It is shown that these do not all have the same asymptotic distribution, and that in general none of the output, input, or feedback processes is renewal. These results have implications in the application of certain decomposition results to queueing networks.
ISSN:0028-1441
DOI:10.1002/nav.3800270411
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1980
数据来源: WILEY
|
|