A heuristic algorithm to minimize the number of crews allocated in an airlift operation

Jae D. Hong, M. Jeya Chandra

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we solve the problem of minimizing the number of crews required for completing a mission within a specified time period in an airlift operation. A heuristic algorithm is developed based on the marginal idle time of the aircraft. Numerical examples are reported, to compare the efficiency of the algorithm with the computer software, GINO, used generally for solving nonlinear programming problems.

Original languageEnglish (US)
Pages (from-to)389-396
Number of pages8
JournalComputers and Operations Research
Volume17
Issue number4
DOIs
StatePublished - 1990

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A heuristic algorithm to minimize the number of crews allocated in an airlift operation'. Together they form a unique fingerprint.

Cite this