Skip to main content
Springer Nature Link
Log in

For the airplane refueling problem local precedence implies global precedence

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We are given \(n\) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Alidaee, B.: Numerical methods for single machine scheduling with non-linear cost functions to minimize total cost. J. Oper. Res. Soc. 44(2), 125–132 (1993)

    Article  MATH  Google Scholar 

  2. Bagga, P., Karlra, K.: A node elimination procedure for Townsend’s algorithm for solving the single machine quadratic penalty function scheduling problem. Manag. Sci. 26(6), 633–636 (1980)

    Article  MATH  Google Scholar 

  3. Croce, F., Tadei, R., Baracco, P., Di Tullio, R.: On minimizing the weighted sum of quadratic completion times on a single machine, pp. 816–820. In: Proceedings of the IEEE International Conference on Robotics and Automation (1993)

  4. Dürr, C., Vásquez, O. C.: Order constraints for single machine scheduling with non-linear cost, pp. 98–111. In: Proceedings of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX) (2014)

  5. Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on a single machine, pp. 230–243. In: Proceedings of the 14th International Conference of Integer Programming and Combinatorial Optimization (IPCO) (2010)

  6. Gamow, G., Stern, M.: Puzzle-Math. Viking, New York (1958)

    MATH  Google Scholar 

  7. Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to a formal basis for the heuristic determination of minimum cost paths. ACM SIGART Bull. 37, 28–29 (1972)

    Article  Google Scholar 

  8. Höhn, W.: Scheduling (Dagstuhl Seminar 13111). Dagstuhl Research Online Publication Server (pp. 32–33) (2013)

  9. Höhn, W., Jacobs, T.: An experimental and analytical study of order constraints for single machine scheduling with quadratic cost, pp. 103–117. In: Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX) (2012)

  10. Höhn, W., Jacobs, T.: On the performance of Smith’s rule in single-machine scheduling with nonlinear cost, pp. 482–493. In: Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN) (2012)

  11. Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed, pp. 745–756. In: Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP) (2013)

  12. Mondal, S., Sen, A.: An improved precedence rule for single machine sequencing problems with quadratic penalty. Eur. J. Oper. Res. 125(2), 425–428 (2000)

    Article  MATH  Google Scholar 

  13. Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Manag. Sci. 12(5), 437–447 (1966)

    Article  MathSciNet  Google Scholar 

  14. Sen, A.K., Bagchi, A., Ramaswamy, R.: Searching graphs with A*: applications to job sequencing. IEEE Trans. Syst. Man Cybernet. Part A: Syst. Hum. 26(1), 168–173 (1996)

    Article  Google Scholar 

  15. Sen, T., Dileepan, P., Ruparel, B.: Minimizing a generalized quadratic penalty function of job completion times: an improved branch-and-bound approach. Eng. Costs Prod. Econ. 18(3), 197–202 (1990)

    Article  Google Scholar 

  16. Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2), 59–66 (1956)

    Article  MathSciNet  Google Scholar 

  17. Szwarc, W.: Decomposition in single-machine scheduling. Ann. Oper. Res. 83, 271–287 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Townsend, W.: The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag. Sci. 24(5), 530–534 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  19. Vásquez O.C.: On the complexity of the single machine scheduling problem minimizing total weighted delay penalty. Oper. Res. Lett. 42(5), 343–347 (2014)

  20. Woeginger, G.J.: Scheduling (Dagstuhl Seminar 10071). Dagstuhl Research Online Publication Server, p. 24 (2010)

Download references

Acknowledgments

The author would like to thank Christoph Dürr for several helpful conversations. This work is supported by ANR-Netoc.

Author information

Authors and Affiliations

  1. Industrial Engineering Department, University of Santiago of Chile, Santiago, Chile

    Oscar C. Vásquez

  2. LIP6, Université Pierre et Marie Curie, Paris, France

    Oscar C. Vásquez

Authors
  1. Oscar C. Vásquez
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Oscar C. Vásquez.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vásquez, O.C. For the airplane refueling problem local precedence implies global precedence. Optim Lett 9, 663–675 (2015). https://doi.org/10.1007/s11590-014-0758-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0758-2

Keywords