Journal
OPTIMIZATION LETTERS
Volume 9, Issue 4, Pages 663-675Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-014-0758-2
Keywords
Scheduling; Precedence rules; Algorithm A*
Funding
- ANR-Netoc
Ask authors/readers for more resources
We are given airplanes, which can refuel one another during the flight. Each airplane has a specific tank volume and gas consumption rate. The goal of the airplane refueling problem is to find a drop out permutation for the planes that maximizes the distance traveled by the last plane to drop out. This paper studies some structural properties of the problem and proposes pruning rules for an exact resolution.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available