摘要:

AbstractThe Weber Problem generalized to the location of several new points with respect to existing points is formulated as a linear programming problem under the assumption that distances are rectangular. The dual problem is then formulated and subsequently reduced to a problem with substantially fewer variables and constraints than required by an existent alternative linear programming formulation.Flows may exist between new as well as between new and existing points. Linear constraints can be imposed to restrict the location of new points. Pairwise constraints limiting distances between new points and between new and existing points can also be accommodated.

ISSN:0028-1441    

DOI:10.1002/nav.3800220112

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

年代:1975

数据来源: WILEY

摘要:

AbstractWe consider the scheduling ofnjobs onmidentical machines when the jobs become available for processing at ready timesai,ai, ⩾ 0, requireditime units for processing and must be completed by timesbifori= 1, 2, …n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi‐stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is al

ISSN:0028-1441    

DOI:10.1002/nav.3800220113

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

年代:1975

数据来源: WILEY

摘要:

AbstractThis paper treats an approximate continuous review inventory model with backlogging of excess demand and stochastic leadtime. The major result derived is that the behavior of the optimal order size with respect to the shortage cost parameter is determined solely by the “conditional mean residual life” function corresponding to the leadtime demand distribution. Some minor results and illustrative examples are also inclu

ISSN:0028-1441    

DOI:10.1002/nav.3800220114

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

年代:1975

数据来源: WILEY

摘要:

AbstractAmong the many tools of the operations researcher is the transportation algorithm which has been used to solve a variety of problems ranging from shipping plans to plant location. An important variation of the basic transportation problem is the transportation problem with stochastic demand or stochastic supply. This paper presents a simple approximation technique which may be used as a starting solution for algorithms that determine exact solutions. The paper indicates that the approximation technique offered here is superior to a starting solution obtained by substituting expected demand for the random variables.

ISSN:0028-1441    

DOI:10.1002/nav.3800220115

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

年代:1975

数据来源: WILEY

摘要:

AbstractA supplementary time variable approach is used to analyze a battle where attackers search for defended logistical targets and the future actions of an attacker depend on its activities in the whole time interval since arrival at the operating area. As compared with the method discussed in this paper a corresponding Markov chain analysis of the problem requires a considerably greater number of mathematical relations for state transition probabilities with less possibilities in obtaining numerical solutions effectively and with less para‐metrical insight. A supplementary time variable is introduced to describe the arrival instants of attackers at the operating area, and is then used to express the probability generating functions of the losses at an arbitrarily selected time instant in terms of a general description of the capabilities of an individual attacker in the time interval since arrival. These capabilities are then related to a selected set of lower level parameters describing a specific battle situation by using a small set of integral relations of the multiple convolution type with solutions expressed as Laplace transform

ISSN:0028-1441    

DOI:10.1002/nav.3800220116

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

年代:1975

数据来源: WILEY

摘要:

AbstractThis paper considers a two sided resource allocation game in which both players initially have fixed resources which may be distributed over various targets. Their effectiveness depends on the manner of distribution and also on the strategy of the opponent, a natural payoff function for such a situation being used. The complete solution to the game is derived and a numerical example given.

ISSN:0028-1441    

DOI:10.1002/nav.3800220117

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

年代:1975

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800220101

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

年代:1975

数据来源: WILEY