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

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 562
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCha, YHko
dc.contributor.authorKim, Yeong-Daeko
dc.date.accessioned2013-03-09T06:09:55Z-
dc.date.available2013-03-09T06:09:55Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2010-10-
dc.identifier.citationOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, v.38, pp.383 - 392-
dc.identifier.issn0305-0483-
dc.identifier.urihttp://hdl.handle.net/10203/95555-
dc.description.abstractIn 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.-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectTARGET-ASSIGNMENT PROBLEM-
dc.subjectMULTIPROCESSOR TASKS-
dc.subjectALLOCATION PROBLEM-
dc.subjectALGORITHM-
dc.subjectOPTIMIZATION-
dc.subjectPROCESSORS-
dc.subjectMODELS-
dc.subjectSHOP-
dc.titleFire scheduling for planned artillery attack operations under time-dependent destruction probabilities-
dc.typeArticle-
dc.identifier.wosid000276630700016-
dc.identifier.scopusid2-s2.0-79957554163-
dc.type.rimsART-
dc.citation.volume38-
dc.citation.beginningpage383-
dc.citation.endingpage392-
dc.citation.publicationnameOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE-
dc.identifier.doi10.1016/j.omega.2009.10.003-
dc.contributor.localauthorKim, Yeong-Dae-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorMilitary-
dc.subject.keywordAuthorScheduling-
dc.subject.keywordAuthorBranch and bound algorithm-
dc.subject.keywordPlusTARGET-ASSIGNMENT PROBLEM-
dc.subject.keywordPlusMULTIPROCESSOR TASKS-
dc.subject.keywordPlusALLOCATION PROBLEM-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusPROCESSORS-
dc.subject.keywordPlusMODELS-
dc.subject.keywordPlusSHOP-
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 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0