Complexity of the Fire Sequencing Problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 358
  • Download : 0
In this note, we introduce the Fire Sequencing Problem, which arises in military operations Given m weapons, n fixed targets and required duration of firing of the weapons on the targets, we want to determine the start time of firing on each target so that makespan is minimized while satisfying various operational constraints. We show that the decision problem of the Fire Sequencing problem is strongly NP-complete and remains strongly NP-complete even if the number of weapons is two. We also briefly discuss the results with respect to the complexities of several well-known scheduling models.
Publisher
한국경영과학회
Issue Date
1999-11
Language
Korean
Citation

IJMS(INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE), v.5, no.2, pp.55 - 59

ISSN
1225-1119
URI
http://hdl.handle.net/10203/69895
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0