摘要:

AbstractThe basic model starts with three stochastic processes satisfying y(t) = x(t) + z(t). Observations are made on the y‐process from which inferences are made about the production process, x(t). The z‐process constitutes noise. For each unit of time that x(t) = x the income is i(x). The producer, at a cost in both time and money, can repair the y‐process, i.e., bring its value back to zero. Continuous surveillance at no cost and intermittent surveillance with a fixed cost for each observation are considered, When the x‐ and z‐processes are independent Poisson processes, it is shown that the strategies which maximize the average income per unit of time depend only on the last observed value of the y‐process. Production is continued until the y‐process exceeds a specified integer which depends on the economic parameters. When i(x) is nonincreasing and costly inspections are being made, the time between inspections decreases as a function of the last observed value of the y‐process. The model is a generalization of the model used in Ref. [3]See Refer

ISSN:0028-1441    

DOI:10.1002/nav.3800110102

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

年代:1964

数据来源: WILEY

摘要:

AbstractThis article describes some transportation problems and presents algorithms for solving them. Except for the brief review of Network Flow Theory, which is used in developing the algorithm for the Fixed Resources‐Maximum Job Scheduling Problem, these are all scheduling problems.The Fixed Job–Minimum Resources Scheduling Problem presents a finite set of jobs, called sorties, to be done at given fixed times. The problem is to find, for vehicles of a given type, a schedule of greatest merit. One of the objectives involved in the definition of the merit function is that of minimizing the number of vehicles used.The Fixed Resources–Maximum Job Scheduling Problem is similar to the Fixed Job–Minimum Resources Scheduling Problem except that only a certain maximum number of vehicles maybe used, and the objective of minimizing the number of vehicles is replaced by the objective of maximizing the amount of work done. Also, in this section, it is shown that problems possessing certain symmetries are equivalent to simpler ones.The Slack Time–Fixed Job Scheduling Problem is somewhat analogous to the Fixed Job–Minimum Resources Scheduling Problem, and the Slack Time–Fixed Resources Scheduling Problem is somewhat analogous to the Fixed Resources, Maximum Job Scheduling Problem. The main difference is that instead of requiring that each sortie be performed at some given time, it is only required that it be performed within some given interval of time.The Slack Time–Fixed Job Scheduling and–Fixed Resources Scheduling Problems are more difficult to solve than the Fixed Job–Minimum Resources Scheduling and the Fixed Resources–Maximum Job Scheduling Problems. So in the Slack Time–Fixed Job Scheduling Problem a simplifying assumption is made concerning the times that it would take vehicles to return from destination points of sorties to the starting points of others. The method of solution presented for the Slack Time–Fixed Resources Scheduling Problem does not guarantee optimum solutions, but, it is hoped, good solutions. For a certain type of shuttling problem, it is proven that it does pr

ISSN:0028-1441    

DOI:10.1002/nav.3800110103

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

年代:1964

数据来源: WILEY

摘要:

AbstractThe assignment problem, which is the most degenerate form of the transportation problem, and therefore the most likely to cycle, is investigated by means of linear graphs. It is proved that cycling is impossible in the 3 × 3 case, but possible in the 4 × 4 case. For the 5 × 5 case, it is shown both that there is a cycle independent of the one found for the 4 × 4 case and also that the cycle found in the 4 × 4 case can exist in the 5 × 5 case. Numerical examples are

ISSN:0028-1441    

DOI:10.1002/nav.3800110104

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

年代:1964

数据来源: WILEY

摘要:

AbstractThis paper analyzes a queueing structure for a time‐shared service facility (or processor) and compares these results with a straightforward first‐come first‐served discipline. The assumption is that the processing time for each job is chosen from a geometric distribution. This time‐shared discipline shares the desirable features of a first‐come first‐served principle, as well as that of a discipline which services short jobs first. It is shown that those jobs with shorter than average processing requirements, spend less time in the queue than they would in a strict first‐come first‐served system, and conversely for longer th

ISSN:0028-1441    

DOI:10.1002/nav.3800110105

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

年代:1964

数据来源: WILEY

摘要:

AbstractThis article is concerned with von Neumann's algorithm for solving a matrix game. Some of the numerical comparisons, made between this algorithm and three others from the literature, have been abstracted for discussion. In general, the performance of von Neumann's algorithm is inferior to other methods for solving matrix games; Dantzig's Simplex Method converges in fewer iterations; and Brown's Fictitious Play requires a much simpler arithmetic process and fewer iterations for a similar convergence.

ISSN:0028-1441    

DOI:10.1002/nav.3800110106

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

年代:1964

数据来源: WILEY

摘要:

AbstractAn integer linear programming model for computing the minimum number of ships needed to embark a task organization and its attendant transfer vehicles is developed. The implementation of the model on a computer is discussed.

ISSN:0028-1441    

DOI:10.1002/nav.3800110107

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

年代:1964

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800110108

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

年代:1964

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800110109

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

年代:1964

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800110101

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

年代:1964

数据来源: WILEY