Academia.eduAcademia.edu

Outline

Title
Abstract
Background and Purpose
Scope
Objectives
Chapter 2. Literature Review
Critical Path Method
Critical Path Method Example
Unrelated Parallel Machines
Chapter Summary
Chapter 3. Methodology
Summary
Tsacp Results
Case Study
Chapter 5. Conclusions and Recommendations
Recommendations for Future Work
References
All Topics
Engineering
Mechanical Engineering

A Tabu Search for Scheduling and Rescheduling Combat Aircraft

Profile image of Kevin CalhounKevin Calhoun

2012

Abstract

Form Approved OMB No. 074-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of the collection of information, including suggestions for reducing this burden to Washington Headquarters Services, Directorate for Information Operations and Reports,

Related papers

Daily aircraft routing and scheduling
Jacques Desrosiers

Management …, 1997

Les textes publiés dans la série des rapports de recherche HEC n'engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d'une subvention du Fonds F.C.A.R.

View PDFchevron_right
Analysis of Decision Postponement Strategies for Aircraft Assignment
Ebru Bish

2002

The ability to effectively match supply and demand can lead to significant revenue benefits in the airline industry. Airline supply management deals with assigning the right resources (i.e., aircraft and crew) to the right routes in the flight network. Due to certain crew regulations, operating characteristics, and constraints of the airline companies, these supply management decisions need to be made well in advance of departures, at a time when demand is highly uncertain. However, demand forecasts improve markedly over time, as more information on demand patterns is gathered.

View PDFchevron_right
Task allocation for wide area search munitions with variable path length
Hank Walker

2003

The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS.

View PDFchevron_right
Annual Scheduling of Atlantic Fleet Naval Combatants
Gerald G. Brown

2003

View PDFchevron_right
Sortie Optimization and Munitions Planning
Gerald G. Brown

1993

Since 1965, the United States Air Force has relied on mathematical programming for the planning of conventional air-to-ground munitions. The centerpiece of this planning effort is HEAVY AITACK, a theater-level model employing large-scale nonlinear programming to load weapons onto aircraft and assign sorties to targets. The single-period objecti\'e is to maximize the expected destroyed target value over the forecast weather states by assigning sorties which use the best delivery tactics in each weather state with available aircraft and weapons stocks. Over multiple periods, HEAVY ArrACK accounts for differences between targets in regeneration rate, value, and ease of damage assessment, and evaluates aircraft attrition and remaining weapons stocks, mounting the best sorties possible with the remaining resources. In 1988 approximately $2 billion worth of weapons were purchased with guidance from HEAVY AITACK; additional expenditures of $5.2 billion are being planned for 1994-99. In 199G-91, media coverage of Desert Storm made the focus of HEAVY ArrACK apparent to millions of viewers. As many arrows, loosed several ways, _ so maya thousand actions, once afoot, end in one purpose, and be all well borne without defeat.

View PDFchevron_right
Battle Management Algorithms for Autonomous Unmanned Systems (BMAAUS)
Jennifer Seitzer

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to Washington Headquarters Services, Directorate for Information Operations and Reports,

View PDFchevron_right
Scheduling in a Defence Environment
Patrick Weaver

2007

View PDFchevron_right
Fleet-Level Selective Maintenance and Aircraft Scheduling
Scott Mason

2003

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS.

View PDFchevron_right
Scheduling Aircrews 1: Intra-Theater 24/7 Operations
James C Miller

2005

Aircrew fatigue problems existed in around-the-clock (24/7), intra-theater, tactical airlift operations. One reason was the irregularity of the schedule for a given crew across days. There are three approaches to 24/7 scheduling: fixed shifts, rapidly rotating shifts and slowly rotating shifts. The assumption made here was that some sort of a rotating shift was necessary. Seven scheduling principles were applied: - Set a normal, maximum crew duty period (CDP) of 14 hours to allow a crew to work on a 24-h cycle (AFI 11-202, Paragraph 9.7.4.1). - Follow each CDP longer than 14 h with a day off (AFI 11-202, Paragraph 9.7.6.2). - Schedule either: -- A long sequence of night shifts in a slowly-rotating schedule (with adequate sleep facilities) to allow acclimation to night work and day sleep, or -- A minimum number of consecutive night shifts in a rapidly-rotating schedule to minimize exposure to night work where sleeping facilities are inadequate (see Appendix E). - In a rapidly-rotating system, follow each night shift with 24 hours off. - Schedule long, contiguous periods of time off. - Assure equity by giving all aircrews equal demands for long CDPs and night work and equal access to day work and good quality time off. - Schedule an aircrew such that their show time does not differ more than +/-1 hour on successive days to allow the crew to continue on a 24-h cycle.

View PDFchevron_right
Description and analysis of military planning systems
Abdeslem Boukhtouta

2005

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

View PDFchevron_right

References (51)

  1. Air Force Instruction 13-1AOC Volume 3: Operational Procedures-Aerospace Operations Center, HQ USAF/XOCE 1 June 1999.
  2. Air Force Manual 1-1: Basic Aerospace Doctrine of the United States Air Force, II, U.S. Government Printing Office, March 1992.
  3. Battlestaff Training School, Joint Air Operations Staff Course (JAOSC), Course Handout, USAF Air Ground Operations School, Hurlbert Field, FL, Jan 98. Joint Pub 3-56J: Command and Control for Joint Air Operations, Washington: Department of Defense, November 1994.
  4. Scheduling Theory: Course notes, Deckro, Richard, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH Summer, 1999.
  5. Abt, Paul E., "Air Campaign Planning," Theater Battle Management Core Systems Newsletter, Vol. 3 No.l 15-17 January 1997.
  6. Ahuja, R., Magnanti, T., Orlin, J. Network Flows: Theory, Algorithms, and Applications, New Jersey: Prentice Hall (1993).
  7. Barbarosoglu, G. and D. Ozgur "A Tabu Search Algorithm for the Vehicle Routing Problem," Computers and Operations Research, Vol. 26: 255-270 (1999).
  8. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W.R.Jr., "Designing and Reporting on Computational Experiments with Heuristic Methods" Journal of Heuristics, Vol. 1 No. 1 p. 9-32, (Fall 1995).
  9. Barnes, J.W. and W.B. Carlton "Solving the Vehicle Routing Problem with Time Windows Using Reactive Tabu Search," presented at the Fall INFORMS National Meeting in New Orleans, Louisiana (1995).
  10. Battiti, Roberto, "Reactive Search: Toward Self-tuning Heuristics," Modern Heuristic Search Methods. Ed. Rayward-Smith V. et al., Chichester, UK: John Wiley and Sons, (1996).
  11. Baykasoglu, A., "Solution of Goal Programming Models Using a Basic Taboo Search Algorithm," Journal of the Operational Research Society, Vol. 50 No. 9 pp. 960-973, (Sep 1999).
  12. Boctor, Fayez F. "A New and Efficient Heuristic for Scheduling Projects with Resource Restrictions and Multiple Execution Modes," European Journal of Operational Research, P0(2):349-361 (April 1996).
  13. Carlton, W. and Barnes J., "A Note on Hashing Functions and Tabu Search Algorithms," European Journal of Operational Research, Vol. 95:237-239 (1996).
  14. Carruthers, JA. and A. Battersby. "Advances in Critical Path Methods," Operations Research Quarterly, 17:359-380 (1966).
  15. Charnes, A., W. Cooper, R. Ferguson, "Optimal estimation of Executive Compensation by Linear Programming," Management Science, Vol 1:138-151(1955).
  16. Charnes, A., Cooper, W., Harrald, J., Karwan, K., Wallace, W. "A Goal Interval Programming Model for Resource Allocation in a Marine Environmental Protection Program," Journal of'Environmental Economics and Management, 3:347-362 (1976).
  17. Cohen, Eliot A., Gulf War Air Power Survey: Planning and Command and Control, Technical Report AD-A279741, Department of the Air Force (1993).
  18. Colletti, Bruce W., Group Theory and Metaheuristics, Dissertation, University of Texas, Austin, TX (May 1999).
  19. Cotsworth, W.L., The Conventional Targeting Effectiveness Model (CTEM) User's Manual, AEM Services, Inc., S-93-006-DEN, (31 December 1993).
  20. Deckro, Richard and John Hebert, "Polynomial Goal Programming: A Procedure for Modeling Preference Trade-Offs," Journal of Operations Management, Vol. 7, No. 4:149-164 (December 1988).
  21. Deitel, H., and P. Deitel, Java: How to Program, Prentice Hall, (1998).
  22. DelPAmico, M. and Trubian, M. "Applying Tabu Search to the Job-shop Scheduling Problem" Annals of Operations Research, Vol. 41: 231-252 (1993).
  23. Desrochers. M., J. Desrosiers, and M. Solomon "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, Volume 40: 342-354 (1992).
  24. Gandibleux, X.; Mezdaoui, N.; Freville, A. "A Tabu Search Procedure to Solve Multiobjective Combinatorial Optimization Problem" Lecture notes in economics and mathematical systems. Vol. 455: (1997).
  25. Garcia, B.L., J.Y. Potvin, and J.M. Rousseau "A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints," Computers and Operations Research, Vol. 21: 1025-1033 (1994).
  26. Glover, Fred. "Tabu Search: A Tutorial" Interfaces, Vol. 20:4 pp. 74-94, July-August, 1990.
  27. Glover, Fred and Manuel Laguna. "Chapter 3: Tabu Search," Modern Heuristic Techniques for Combinatorial Problems, ed. Colin R. Reeves, John Wiley & Sons, Inc, (1993).
  28. Glover, Fred and Laguna, Manuel Tabu Search, Boston: Kluwer Academic Publishers, (1997).
  29. Gonzales, Daniel R. Evolution of the Air Campaign Planning Process and the Contingency Theater Automated Planning System (CTAPS). Technical Report MR- 618-AF, 1700 main St., P.O. box 2138, Santa Monica, CA 90407-2138: RAND, 1996.
  30. Haas, William R., An Operational Review of Air Campaign Planning Automation, Thesis, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, March 1998.
  31. Jensen, Paul A., "Integer Programming." Integer Programming course handout. School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, OH, July 1994.
  32. Jozefowska, J., Waligora, G. and Weglarz, J. "A Tabu Search Algorithm for Some Discrete-Continuous Scheduling Problems" Modern Heuristic Search Methods, Ed. Rayward-Smith, V., Osman, I., Reeves, C. and Smith, G. Chichester, UK: John Wiley and Sons, (1996).
  33. Kelley, James E. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, 9(3):296-320 (May-June 1961).
  34. Koewler, David A., An Approach for Tasking Allocated Combat Resources to Targets, Thesis, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, (March 1999).
  35. Kolisch, Rainer, Sprecher, and Drexl, Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems. Manuskripte aus den Instituten fur Betriebswirtschaftslehere, No. 301, University of Kiel, Germany (December, 1992).
  36. Kolisch, Rainer, Sprecher, and Drexl, "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, 41(11):1693-1703 (1995).
  37. Laguna, M., J. Barnes, and F. Glover, "Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs Using Tabu Search," research report, Department of Mechanical Engineering, University of Texas-Austin (April 1989).
  38. Lokketangen, A. and F. Glover, "Solving Zero-one Mixed Integer Programming Problems Using Tabu Search," European Journal of Operational Research, Vol. 106: 624-658 (1998).
  39. Mooney, E. and Rardin, R. "Tabu Search for a Class of Scheduling Problems" Annals of Operations Research, Vol. 41: 253-278 (1993).
  40. Nowicki, E, and C. Smutnicki, "A Fast Taboo Search Algorithm for the Job Shop Problem" Management Science, Vol. 42, No. 6: 797-813 (1996).
  41. Pinedo, Michael Scheduling Theory, Algorithms, and Systems, New Jersey: Prentice Hall, (1995).
  42. Pritsker, A., L. Wärters, and P. Wolfe, "Multi-Project Scheduling with Limited Resources: a Zero-One Programming Approach," Management Science, itf(l):93-108 (September 1969).
  43. Rangaswamy, B., Jain, A. and Glover, F. "Tabu Search Candidate List Strategies in Scheduling" Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Ed. Woodruff, D., Boston: Kluwer Academic Publishers (1998).
  44. Romero, Carlos, Handbook of Critical Issues in Goal Programming, Pergamon Press, (1991).
  45. Shrub, A., J. Bard, S. Globerson, Project Management Engineering, Technology, and Implementation, New Jersey: Prentice Hall, (1994).
  46. Slowinski, Roman et al., "DSS for Multiobjective Project Scheduling," European Journal of Operational Research, 79:220-229 (1994).
  47. Urman, Scott, Oracle8 PL/SQL Programming, McGraw-Hill, Berkeley, CA, 1997.
  48. Van Hove, John C, Personal E-mail, Air Force Logistics Management Agency, USAF, Maxwell AFB, Gunter Annex, (16 March 2000).
  49. Van Hove, John C, An Integer Program Decomposition Approach to Combat Planning, Dissertation, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, (October 1998).
  50. Winston, Wayne L. Operations Research: Applications and Algorithms (3 r edition). Belmont, CA: Wadsworth Publishing Company, (1994).
  51. Yost, Kirk A., "Consolidating the USAF's Conventional Munitions Models," Military Operations Research, Vol. 2, Number 4:53-71 (1996).

Related papers

Military stochastic scheduling treated as a" multi-armed bandit" problem
Kevin Glazebrook

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302, and to the Office of Management and Budget, Paperwork Reduction Project (0704-0188), Washington, DC 20503.

View PDFchevron_right
Time Sensitive Control of Air Combat Operations
Alexander Levis

1998

Public reporting burden for this collection of information is estimated to average 1 hour per response, indue gathering and maintaining the data needed, and completing and reviewing the collection of information. Se collection of information, including suggestions for reducing this burden, to Washington Headquarters Servic Davis Highway, Suite 1204, Arlington, VA 22202-4302, and to the Office of Management and Budget, Pape

View PDFchevron_right
Optimizing Operational and Logistical Planning in a Theater of Operations
Gerald G. Brown

2009

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including

View PDFchevron_right
Scheduling of an aircraft fleet
Massimo Paltrinieri

… Notes from the 1992 AAAI Spring …, 1992

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and ...

View PDFchevron_right
UAV Scheduling via the Vehicle Routing Problem with Time Windows
Amanda Weinstein

AIAA Infotech@Aerospace 2007 Conference and Exhibit, 2007

The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS.

View PDFchevron_right

Related topics

  • Engineering
  • Computer Science
  • Modal Analysis
  • Military Strategy
  • Military Aircraft
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved