摘要:

AbstractA carrier battle group is operating in an area where it is subject to attack by enemy aircraft. It is anticipated that air raids will occur in large waves. The uncertain time between raids is available for the replenishment of supplies. We consider the problem of how best to schedule ammunition replenishment during this period. The theory of Gittins indices provides the technical background to the development of a range of models which yield a hierarchy of index‐based heuristics for replenishment. One such heuristic is assessed computationally in a more realistic scenario than is explicitly allowed for by the model

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<637::AID-NAV3220380502>3.0.CO;2-B

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

年代:1991

数据来源: WILEY

摘要:

AbstractThis article addresses the problem of scheduling the United States Navy's Atlantic Fleet to satisfy overseas strategic requirements. An integer programming formulation is developed but results in a model with prohibitive size. This fact and the qualitative nature of additional secondary objectives and constraints suggest an interactive optimization approach. A system that solves a natural relaxation of the integer program within an interactive environment is discussed.

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<669::AID-NAV3220380503>3.0.CO;2-Y

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

年代:1991

数据来源: WILEY

摘要:

AbstractIn recent years, much attention has focused on mathematical programming problems with equilibrium constraints. In this article we consider the case where the constraints are complementarity constraints. Problems of this type arise, for instance, in the design of traffic networks. We develop here a descent algorithm for this problem that will converge to a local optimum in a finite number of iterations. The method involves solving a sequence of subproblems that are linear programs. Computational tests comparing our algorithm with the branch‐and‐bound algorithm in [7] bear out the efficacy of our method. When solving large problems, there is a definite advantage to coupling both methods. A local optimum incumbent provided by our algorithm can significantly reduce the computational effort required by the branch‐and‐bound al

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<679::AID-NAV3220380504>3.0.CO;2-S

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

年代:1991

数据来源: WILEY

摘要:

AbstractWithout restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner‐Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady‐state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two produ

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<699::AID-NAV3220380505>3.0.CO;2-J

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

年代:1991

数据来源: WILEY

摘要:

AbstractWe consider a one‐machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due‐date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functi

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<715::AID-NAV3220380506>3.0.CO;2-6

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

年代:1991

数据来源: WILEY

摘要:

AbstractThe problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<721::AID-NAV3220380507>3.0.CO;2-4

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

年代:1991

数据来源: WILEY

摘要:

AbstractWe consider a single‐product, discrete‐time production/inventory‐control problem with nonstationary concave nondecreasing costs. Given a forecast horizonK, the problem is to find a decision horizon. We specialize to piecewise linear costs a general approach whereby a problem with horizonK+ 1 and arbitrary final demand is parametrically solved. The resulting algorithm is polynomial in the input

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<729::AID-NAV3220380508>3.0.CO;2-U

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

年代:1991

数据来源: WILEY

摘要:

AbstractMediators increase the effectiveness of negotiation processes. The art of mediation includes interpersonal skills, ability to convince, and proficiency in argumentation. The science of mediation represents an analytical approach to problem solving, a systematic analysis of the process, of players' positions, and of their goals, aspirations, and concessions. Analytical tools for mediation can be used by mediators, but these tools can also support negotiators in their analysis, verification of their positions, and choices. The knowledge of effective and safe alternatives, of sets of compromises, and the knowledge of the possible outcomes of concessions may be used to develop an effective strategy and to increase a negotiator's bargaining power. Models to analyze alternatives, to verify concessions made by the opponents, to determine effective alternatives, and to search for solutions that yield mutual gains, to aggregate opponents' proposals, to look for coalition members, and to simulate some of the actions of a mediator are discussed in the article.

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<743::AID-NAV3220380509>3.0.CO;2-R

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

年代:1991

数据来源: WILEY

摘要:

AbstractIn this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location probl

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<763::AID-NAV3220380510>3.0.CO;2-A

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

年代:1991

数据来源: WILEY

ISSN:0894-069X    

DOI:10.1002/1520-6750(199110)38:5<::AID-NAV3220380501>3.0.CO;2-O

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

年代:1991

数据来源: WILEY