Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities

Cited 11 time in webofscience Cited 0 time in scopus
  • Hit : 366
  • Download : 0
In this paper, we consider the fire scheduling problem (FSP) for field artillery, which is the problem of scheduling operations of firing at given targets with a given set of weapons. We consider a situation in which the number of available weapons is smaller than the number of targets, the targets are assigned to the weapons already, and targets may move and hence the probability that a target is destroyed by a firing attack decreases as time passes. We present a branch and bound algorithm for the FSP with the objective of minimizing total threat of the targets, which is expressed as a function of the destruction probabilities of the targets. Results of computational tests show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. (C) 2009 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2010-10
Language
English
Article Type
Article
Keywords

TARGET-ASSIGNMENT PROBLEM; MULTIPROCESSOR TASKS; ALLOCATION PROBLEM; ALGORITHM; OPTIMIZATION; PROCESSORS; MODELS; SHOP

Citation

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, v.38, pp.383 - 392

ISSN
0305-0483
DOI
10.1016/j.omega.2009.10.003
URI
http://hdl.handle.net/10203/95555
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 11 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0