Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 364
  • Download : 0
We consider an operations planning problem in a military aviation unit that performs a number of flight missions with multiple identical aircrafts. The problem is to assign the flight missions to the aircrafts and to schedule these assigned missions on each aircraft. Sequence-dependent setup times are required between the missions, and multiple aircrafts may be needed for a mission, but the aircrafts assigned to the same mission should start the mission simultaneously. We develop heuristic algorithms for the problem with the objective of minimizing makespan, i.e., the time by which all the missions have been completed. For evaluation of the performance of the algorithms, a series of computational tests was performed on a number of problem instances, and results show that the proposed algorithms give good or near optimal solutions in a reasonable amount of time. (C) 2011 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2011-11
Language
English
Article Type
Article
Keywords

DEPENDENT SETUP TIMES; IDENTICAL PARALLEL MACHINES; MULTIPROCESSOR TASKS; MINIMIZING MAKESPAN; HYBRID FLOWSHOP; TABU SEARCH; PROCESSORS; OPTIMIZATION; MINIMIZATION; ARTILLERY

Citation

COMPUTERS INDUSTRIAL ENGINEERING, v.61, no.4, pp.1309 - 1317

ISSN
0360-8352
URI
http://hdl.handle.net/10203/98724
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 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0