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

Jae D. Hong; M. Jeya Chandra

doi:10.1016/0305-0548(90)90017-2

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

Jae D. Hong, M. Jeya Chandra

Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	389-396
Number of pages	8
Journal	Computers and Operations Research
Volume	17
Issue number	4
DOIs	https://doi.org/10.1016/0305-0548(90)90017-2
State	Published - 1990

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1016/0305-0548(90)90017-2

Cite this

@article{2b1ed80eccde40d49b134671fe723337,

title = "A heuristic algorithm to minimize the number of crews allocated in an airlift operation",

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.",

author = "Hong, {Jae D.} and Chandra, {M. Jeya}",

year = "1990",

doi = "10.1016/0305-0548(90)90017-2",

language = "English (US)",

volume = "17",

pages = "389--396",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "4",

}

TY - JOUR

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

AU - Hong, Jae D.

AU - Chandra, M. Jeya

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025665042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025665042&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(90)90017-2

DO - 10.1016/0305-0548(90)90017-2

M3 - Article

AN - SCOPUS:0025665042

SN - 0305-0548

VL - 17

SP - 389

EP - 396

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 4

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this