Skip to main content
SpringerLink
Log in

An algorithm for optimal sequencing of aircraft in the near terminal area

  • Operations Research
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 7))

Abstract

In this paper, the optimal sequencing of aircraft in the near terminal area with a single runway for both landings and take-offs, is considered. This problem is imbedded in the class of problems related to sequencing n jobs (either landings or take-offs) on one machine (the runway). A difference immediately arises, since the jobs are not simultaneously available and once begun must be fully completed. A branch and bound algorithm is developed, by making use of some peculiar properties which hold in this particular case.

The approach proposed looks promising, since it could be used to study more complex problems such as those which arise in the case of more runways or taking into account several classes of aircraft.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.K.PARK, T.A.STRAETER, J.E.HOGGE, An analytic study of near terminal area optimal sequencing and flow control techniques. Agard CP 1O5.

    Google Scholar 

  2. R.W. CONWAY, W.L. MAXWELL, L.W. MILLER, Theory of Scheduling. Addison-Wesley, Reading, Mass., USA, 1967.

    Google Scholar 

  3. K.R.BAKER, Procedures for sequencing tasks with one resource type. Int.J.Prod. Res., Vol.11, n.2, 125–138.

    Google Scholar 

  4. J.SHWIMER, On the N-job, one-machine, sequence independent scheduling problem with tardiness penalties:a branch-bound solution. Mgmt.Sci., vol.18,n.6, Feb. 1972.

    Google Scholar 

  5. G.RINALDI, A.SASSANO, On a job scheduling problem with different ready times:some properties and a new algorithm to determine the optimal solution. Centro di Studio dei Sistemi di Controllo e Calcolo Autom. C.N.R. Roma.R 77-24. To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro di Studio dei Sistemi di Controllo e Calcolo Automatici, Consiglio Nazionale delle Ricerche, Via Eudossiana 18, Roma, Italy

    L. Bianco, B. Nicoletti & S. Ricciardelli

Authors
  1. L. Bianco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Nicoletti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Ricciardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Bianco, L., Nicoletti, B., Ricciardelli, S. (1978). An algorithm for optimal sequencing of aircraft in the near terminal area. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006550

Download citation

  • DOI: https://doi.org/10.1007/BFb0006550

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08708-3

  • Online ISBN: 978-3-540-35890-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation