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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
