摘要:

AbstractWe introduce a real‐time decision support system which uses optimization methods, simulation, and the judgement of the decision maker foroperational assignmentof units to tasks and for tactical allocation of units to task requirements. The system, named ARES for the Greek god of war, accommodates a high degree of detail in the logistics of unit movements during operations, yet separates the assignment and allocation activities in a fashion which naturally accommodates human intervention and judgement—ARES is designed to assist the decision maker, not to replace him. ARES is demonstrated with a hypothetical scenario constructed for 14 Engineering Battalions of the Hellenic Army which are assigned 20 tasks employing 25 resource types in repairing major damage to public works following a great earthquake. (This hypothetical data was prepared prior to the earthquake in Kalamata near Athens on 13 September, 1986, and exhibits uncanny, but coincidental, resemblance to that real situation.) ARES is designed for use in real time, and quick data preparation is aided by the provision from published sources of standard data for many foreseeable tasks; this data can be quickly accessed via visual icons on a computer screen and customized for the actual work at hand. © 1993 John Wiley&Sons,

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<1::AID-NAV3220400102>3.0.CO;2-S

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

年代:1993

数据来源: WILEY

摘要:

AbstractIn this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed‐integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley&Sons, I

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<25::AID-NAV3220400103>3.0.CO;2-2

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis article presents the mathematical background for analyzing maintenance policies with minimal repair. Standard maintenance policies are summarized. A general failure model is introduced which allows a unifying treatment of more recent maintenance policies with minimal repair. In particular, repair cost limit maintenance policies are considered. © 1993 John Wiley&Sons, Inc

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<51::AID-NAV3220400104>3.0.CO;2-V

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis article presents the application of a simulated annealing heuristic to an NP‐complete cyclic staff‐scheduling problem. The new heuristic is compared to branch‐and‐bound integer programming algorithms, as well as construction and linear programming‐based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing‐based method tends to dominate the branch‐and‐bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low‐cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 Jo

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<69::AID-NAV3220400105>3.0.CO;2-H

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

年代:1993

数据来源: WILEY

摘要:

AbstractWe address a single‐machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley&Sons, I

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C

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

年代:1993

数据来源: WILEY

摘要:

AbstractThe problem of optimizing a linear function over the efficient set of a multiple objective linear program is an important but difficult problem in multiple criteria decision making. In this article we present a flexible face search heuristic algorithm for the problem. Preliminary computational experiments indicate that the algorithm gives very good estimates of the global optimum with relatively little computational effort. © 1993 John Wiley&Sons, Inc

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<103::AID-NAV3220400107>3.0.CO;2-A

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

年代:1993

数据来源: WILEY

摘要:

AbstractAn algorithm is given for the conditionalp‐center problem, namely, the optimal location of one or more additional facilities in a region with given demand points and one or more preexisting facilities. The solution dealt with here involves the minimax criterion and Euclidean distances in two‐dimensional space. The method used is a generalization to the present conditional case of a relaxation method previously developed for the unconditionalp‐center problems. Interestingly, its worst‐case complexity is identical to that of the unconditional version, and in practice, the conditional algorithm is more efficient. Some test problems with up to 200 demand points have been solved. © 1993 John Wiley&S

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<117::AID-NAV3220400108>3.0.CO;2-0

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

年代:1993

数据来源: WILEY

摘要:

AbstractHutson and ReVelle [8] define the maximal direct covering tree problem as a bicriterion problem to identify a subtree of a given tree. The two criteria are to maximize demand covered by the subtree and to minimize the cost of the subtree. Demand at a node on the underlying tree is considered covered if it is within some prespecified covering distanceSof the subtree. In the direct covering version of the problem.S= 0.In this article we present a new bicriterion formulation of the maximal direct covering tree problem and present O(n2) algorithms for solving both this problem and the special case where one must add to an existing subtree. The new formulation is extremely concise; consequently, additional constraints may be added where appropriate. This is demonstrated with the addition of a budget constraint. In addition, we demonstrate that the new formulation and algorithm can be readily extended to incorporate indirect covering (i.e.,S>0) as defined by Kim et al. [9]. © 1993 John Wiley&Sons. Inc

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<129::AID-NAV3220400109>3.0.CO;2-T

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

年代:1993

数据来源: WILEY

ISSN:0894-069X    

DOI:10.1002/1520-6750(199302)40:1<::AID-NAV3220400101>3.0.CO;2-J

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

年代:1993

数据来源: WILEY