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

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

0.00 Avg rating0 Votes
Article ID: iaor20083981
Country: United Kingdom
Volume: 17
Issue: 4
Start Page Number: 389
End Page Number: 396
Publication Date: Jun 1990
Journal: Computers and Operations Research
Authors: ,
Keywords: personnel & manpower planning, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.