摘要:

AbstractEach year over 200000 Navy enlisted personnel are assigned new jobs at a cost of over 250 million dollars in moving expenses. The task of selecting assignments is complicated by the fact that an individual can be sent to a technical school (which has a limited capacity) to obtain additional training which makes him eligible for additional jobs. The optimal assignment of Navy personnel with en route training is addressed via an assignment problem with specially structured side constraints. This article presents a new algorithm to solve the integer network problem which is based on resource‐directive decomposition in conjunction with Lagrangian relaxation. The new solution procedure is very fast compared to alternate methods. © 1993 John Wiley&Sons, I

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<581::AID-NAV3220400503>3.0.CO;2-#

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis article presents a recoverable spares model for performance evaluation in a multiechelon inventory environment. This model explicitly incorporates the phenomenon known as multiple failures, in which more than one part can require replacement or repair when an end‐item reaches a maintenance base. The model is shown to be computationally intractable, and an approximation scheme is presented to estimate system performance. © 1993 John Wiley&Sons, I

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<593::AID-NAV3220400504>3.0.CO;2-S

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

年代:1993

数据来源: WILEY

摘要:

AbstractA new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at agesthan at aget(sBt) if the residual lifetime at agesis stochastically greater than or equal to the residual lifetime at aget. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixeds

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<603::AID-NAV3220400505>3.0.CO;2-E

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

年代:1993

数据来源: WILEY

摘要:

AbstractThe Stein‐Chen method for establishing Poisson convergence is used to approximate the reliability of coherent systems with exponential‐type distribution functions. These bounds lead to quite general limit theorems for the lifetime distribution of large coherent systems. © 1993 John Wiley&Sons,

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<617::AID-NAV3220400506>3.0.CO;2-4

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

年代:1993

数据来源: WILEY

摘要:

AbstractWe consider the problem of testing for the decreasing mean residual life ordering introduced in Kochar and Wiens [14]. We treat both the one‐sample and two‐sample problems. The limiting distributions of the proposed test statistics are derived. © 1993 John Wiley&Sons,

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<633::AID-NAV3220400507>3.0.CO;2-#

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

年代:1993

数据来源: WILEY

摘要:

AbstractA new approach for detecting initialization bias in the mean of a simulation output series is presented. The problem is cast in a hypothesis‐testing framework using randomization (permutation) tests. The approach is extremely flexible in that it enables the use of a wide variety of test statistics. Moreover, no assumptions are needed concerning the distribution of the sample of observations. The test is computationally intensive; however, the required computing power does not exceed the capabilities of a personal computer. © 1993 John Wiley&Sons, I

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<643::AID-NAV3220400508>3.0.CO;2-U

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

年代:1993

数据来源: WILEY

摘要:

AbstractIn this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110‐problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non‐continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley&Sons,

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-J

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

年代:1993

数据来源: WILEY

摘要:

AbstractIn this article we solve and analyze a stochastic version of the Boiteux problem by employing the stochastic optimal control method. Our setup is close to that of Thompson [22]. Our focus is to analyze, under the same structure, how different production functions and how the variance in machine deterioration/maintenance affect our optimal machine maintenance and sale date decisions. © 1993 John Wiley&Sons, Inc

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<677::AID-NAV3220400510>3.0.CO;2-3

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

年代:1993

数据来源: WILEY

摘要:

AbstractIf the processing time of each job in a flow shop also depends on the time spent prior to processing, then the choice of a sequence influences processing times. This nonstandard scheduling problem is studied here for the minimum makespan schedule in a flow shop with two machines. The problem is NP‐hard in the strong sense and already contains the main features of the general case [10]. Restricting to the case of permutation schedules, we first determine the optimal release times of the jobs for a given sequence. Permutation schedules are evaluated for this optimal policy, and the scheduling problem is solved using branch‐and‐bound techniques. We also show the surprising result that the optimal schedule may not be a permutation schedule. Numerical results on randomly generated data are provided for permutation schedules. Our numerical results confirm our preliminary study [10]that fairly good approximate solutions can efficiently be obtained in the case of limited computing time using the heuristics due to Gilmore and Gomory [7]. © 1993 John Wiley&Son

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-V

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

年代:1993

数据来源: WILEY

摘要:

AbstractIn this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or rejected and for this decision the state of the queue at the moment of arrival is available as information. To guarantee a high level of service, we formulate a constrained optimization problem. Two types of access control, viz., partitioning policies and sharing policies, are considered. The optimization problem is solved for partitioning policies and the performance of both types of policies is compared. © 1993 John Wiley&Sons, Inc

ISSN:0894-069X    

DOI:10.1002/1520-6750(199308)40:5<719::AID-NAV3220400512>3.0.CO;2-C

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

年代:1993

数据来源: WILEY