DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cha, YH | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2013-03-09T06:09:55Z | - |
dc.date.available | 2013-03-09T06:09:55Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2010-10 | - |
dc.identifier.citation | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, v.38, pp.383 - 392 | - |
dc.identifier.issn | 0305-0483 | - |
dc.identifier.uri | http://hdl.handle.net/10203/95555 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | TARGET-ASSIGNMENT PROBLEM | - |
dc.subject | MULTIPROCESSOR TASKS | - |
dc.subject | ALLOCATION PROBLEM | - |
dc.subject | ALGORITHM | - |
dc.subject | OPTIMIZATION | - |
dc.subject | PROCESSORS | - |
dc.subject | MODELS | - |
dc.subject | SHOP | - |
dc.title | Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities | - |
dc.type | Article | - |
dc.identifier.wosid | 000276630700016 | - |
dc.identifier.scopusid | 2-s2.0-79957554163 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.beginningpage | 383 | - |
dc.citation.endingpage | 392 | - |
dc.citation.publicationname | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | - |
dc.identifier.doi | 10.1016/j.omega.2009.10.003 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Military | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Branch and bound algorithm | - |
dc.subject.keywordPlus | TARGET-ASSIGNMENT PROBLEM | - |
dc.subject.keywordPlus | MULTIPROCESSOR TASKS | - |
dc.subject.keywordPlus | ALLOCATION PROBLEM | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | PROCESSORS | - |
dc.subject.keywordPlus | MODELS | - |
dc.subject.keywordPlus | SHOP | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.