Scheduling Aircraft Landings—The Static Case

References

  • Abela J., Abramson D., Krishnamoorthy M., DeSilva A., Mills G. Computing Optimal Schedules for Landing Aircraft. Proceedings of the 12th National ASOR Conference (1993) Adelaide, Australia:71–90Google Scholar
  • Andreussi A., Bianco L., Ricciardelli S. A Simulation Model for Aircraft Sequencing in the Near Terminal Area. Eur. J. Oper.Res. (1981) 8:345–354CrossrefGoogle Scholar
  • Beasley J. E. OR-Library: Distributing Test Problems by Electronic Mail. J. Oper. Res.Soc. (1990) 41:1069–1072CrossrefGoogle Scholar
  • Beasley J. E. Obtaining Test Problems via Internet. J. Global Optim. (1996a) 8:429–433CrossrefGoogle Scholar
  • Beasley J. E. Private communication, based on attendance at the. APATSI Workshop on Combined Arrival and Departure Management (1996b) . held at Eurocontrol, BrusselsGoogle Scholar
  • Beasley J. E., Krishnamoorthy M., Sharaiha Y. M., Abramson D. Dynamically Scheduling Aircraft Landings—the Displacement Problem. (1995) . Working Paper, available from the first author at The Management School, Imperial College, London, EnglandGoogle Scholar
  • Bianco L., Bielli M., Bianco L., Odoni A. R. System Aspects and Optimization Models in ATC Planning. Large Scale Computation and Information Processing in Air Traffic Control (1993) (Springer-Verlag, Berlin) 47–99CrossrefGoogle Scholar
  • Bianco L., Dell'Olmo P., Giordani S., Sharaiha Y. M., Beasley J. E. Minimizing Total Completion Time Subject to Release Dates and Sequence Dependent Processing Times. Advances in Combinatorial Optimization (1999) 86:393–415Annals of Operations ResearchGoogle Scholar
  • Bianco L., Mingozzi A., Ricciardelli S. The Travelling Salesman Problem with Cumulative Costs. Networks (1993) 23:81–91CrossrefGoogle Scholar
  • Bianco L., Nicoletti B., Ricciardelli S., Stoer J. An Algorithm for Optimal Sequencing of Aircraft in the Near Terminal Area. Optimization Techniques: Proceedings of the 8th IFIP Conference on Optimization Techniques Würzburg, September 5-9, 1977 (1978) Springer-Verlag, Berlin:443–453Part 2, Lecture Notes in Control and Information Sciences 7CrossrefGoogle Scholar
  • Bianco L., Odoni A. R.Large Scale Computation and Information Processing in Air Traffic Control (1993) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Bianco L., Ricciardelli S., Rinaldi G., Sassano A. Scheduling Tasks with Sequence-Dependent Processing Times. Naval Res.Logist. (1988) 35:177–184CrossrefGoogle Scholar
  • Bianco L., Rinaldi G., Sassano A., Odoni A. R., Bianco L., Szegö G. A Combinatorial Optimization Approach to Aircraft Sequencing Problem. Flow Control of Congested Networks (1987) 38(Springer-Verlag, Berlin) 323–339NATO ASI Series, Series F: Computer and Systems ScienceCrossrefGoogle Scholar
  • Blumstein A. The Landing Capacity of a Runway. Opns.Res. (1959) 7:752–763LinkGoogle Scholar
  • Brinton C. R. An Implicit Enumeration Algorithm for Arrival Aircraft Scheduling. Proceedings of the 11th IEEE/AIAA Digital Avionics Systems Conference (1992) IEEE, Piscatatway, NJ:268–274CrossrefGoogle Scholar
  • Brucker P., Thiele O. A Branch & Bound Method for the General-Shop Problem with Sequence Dependent Setup-times. OR Spektrum (1996) 18:145–161CrossrefGoogle Scholar
  • CPLEX OPTIMIZATION INC. Using the CPLEX Callable Library (version 3.0). (1994) (CPLEX Optimization Inc., Incline Valley, NV) Google Scholar
  • Davis T. J., Isaacson D. R., Robinson J. E., Den Braven W., Lee K. K., Sanford B. Operational Test Results of the Passive Final Approach Spacing Tool. (1997) IFAC 8th Symposium on Transportation Systems 97Chania, GreeceAvailable from http://www.ctas.arc.nasa.gov/publications/Google Scholar
  • Dear R. G. The Dynamic Scheduling of Aircraft in the Near Terminal Area. (1976) (MIT, Cambridge, MA) . Report R76-9, Flight Transportation LaboratoryGoogle Scholar
  • Dear R. G., Sherif Y. S. The Dynamic Scheduling of Aircraft in High Density Terminal Areas. Microelect. Reliab. (1989) 29:743–749CrossrefGoogle Scholar
  • Dear R. G., Sherif Y. S. An Algorithm for Computer Assisted Sequencing and Scheduling of Terminal Area Operations. Transp. Res. Part A, Policy and Practice (1991) 25:129–139CrossrefGoogle Scholar
  • Erzberger H. Design Principles and Algorithms for Automated Air Traffic Management. Knowledge-based Functions in Aerospace Systems (1995) 7:1–7:31AGARD Lecture Series no. 200, NATOGoogle Scholar
  • Fischetti M., Laporte G., Martello S. The Delivery Man Problem and Cumulative Matroids. Opns. Res. (1993) 41:1055–1064LinkGoogle Scholar
  • Fox K. R., Gavish B., Graves S. C. A n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem. Opns. Res. (1980) 28:1018–1021LinkGoogle Scholar
  • Franca P. M., Gendreau M., Laporte G., Müller F. M. A Tabu Search Heuristic for the Multiprocessor Scheduling Problem with Sequence Dependent Setup Times. Int. J. Product. Econ. (1996) 43:79–89CrossrefGoogle Scholar
  • Garcia J.-L. MAESTRO—A Metering and Spacing Tool. Proceedings of the 1990 American Control Conference (1990) IEEE, Piscataway, NJ:502–507Google Scholar
  • Guinet A. Textile Production Systems: A Succession of Non-Identical Parallel Processor Shops. J. Oper. Res. Soc. (1991) 42:655–671CrossrefGoogle Scholar
  • Guinet A. Scheduling Sequence-Dependent Jobs on Identical Parallel Machines to Minimize Completion Time Criteria. Int. J. Product. Res. (1993) 31:1579–1594CrossrefGoogle Scholar
  • Hwang H., Sun J. U. Production Sequencing Problem with Reentrant Work Flows and Sequence Dependent Setup Times. Comput. Industr. Eng. (1997) 33:773–776CrossrefGoogle Scholar
  • Isaacson D. R., Davis T. J., Robinson J. E. Knowledge-Based Runway Assignment for Arrival Aircraft in the Terminal Area. AIAA Guidance, Navigation and Control Conference (1997) New Orleans, LAAvailable from http://www.ctas.arc.nasa.gov/publications/CrossrefGoogle Scholar
  • Jordan C., Drexl A. A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. ORSA J. Comput. (1995) 7:160–165LinkGoogle Scholar
  • Lee Y. H., Bhaskaran K., Pinedo M. A Heuristic to Minimize the Total Weighted Tardiness with Sequence-Dependent Setups. IIE Trans. (1997) 29:45–52CrossrefGoogle Scholar
  • Lee K. K., Davis T. J. The Development of the Final Approach Spacing Tool (FAST): A Cooperative Controller-Engineer Design Approach. Control Eng. Pract. (1996) 4:1161–1168CrossrefGoogle Scholar
  • Lee Y. H., Pinedo M. Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup-Times. Eur. J. Oper. Res. (1997) 100:464–474CrossrefGoogle Scholar
  • Liao C. J., Yu W. C. Sequencing Heuristics for Dependent Setups in a Continuous Process Industry. Omega (1996) 24:649–659CrossrefGoogle Scholar
  • Ljungberg M., Lucas A. The OASIS Air Traffic Management System. Proceedings of the 2nd Pacific Rim International Conference on Artificial Intelligence (1992) Seoul, Korea:1003–1009Google Scholar
  • Lockett A. G., Muhlemann A. P. A Scheduling Problem Involving Sequence Dependent Changeover Times. Opns. Res. (1972) 20:895–902LinkGoogle Scholar
  • Low C. Y. Job Shop Scheduling Heuristics for Sequence Dependent Setups. Comput. Industr. Eng. (1995) 29:279–283CrossrefGoogle Scholar
  • Lucas A., Ljungberg M., Evertsz R., Tidhar G., Goldie R., Maisano P. New Techniques for Air Traffic Management for Single and Multiple Airports. (1994) . Technical note 51, Australian Artificial Intelligence Institute, Melbourne, AustraliaGoogle Scholar
  • Lucena A. Time-Dependent Traveling Salesman Problem—The Deliveryman Case. Networks (1990) 20:753–763CrossrefGoogle Scholar
  • Milan J. The Flow Management Problem in Air Traffic Control: A Model of Assigning Priorities for Landings at a Congested Airport. Transp. Plan. Technol. (1997) 20:131–162CrossrefGoogle Scholar
  • Mullins J. Trails of Destruction. New Scientist (1996) 2056:28–31Google Scholar
  • Nilsson N. J.Principles of Artificial Intelligence (1980) (Tioga Publishing Company, Palo Alto, CA) Google Scholar
  • Odoni A. R., Rousseau J.-M., Wilson N. H. M., Pollock S. M., Rothkopf M. H., Barnett A. Models in Urban and Air Transportation. Operations Research and the Public Sector: Handbooks in Operations Research and Management Science (1994) 6(Elsevier Science, Amsterdam) 107–150CrossrefGoogle Scholar
  • Ovacik I. M., Uzsoy R. Worst-Case Error Bounds for Parallel Machine Scheduling Problems with Bounded Sequence-Dependent Setup Times. Opns. Res. Lett. (1993) 14:251–256CrossrefGoogle Scholar
  • Ovacik I. M., Uzsoy R. Rolling Horizon Algorithms for a Single-Machine Dynamic Scheduling Problem with Sequence-Dependent Setup Times. Int. J. Prod. Res. (1994) 32:1243–1263CrossrefGoogle Scholar
  • Ovacik I. M., Uzsoy R. Rolling Horizon Procedures for Dynamic Parallel Machine Scheduling with Sequence-Dependent Setup Times. Int. J. Prod. Res. (1995) 33:3173–3192CrossrefGoogle Scholar
  • Picard J. C., Queyranne M. The Time-Dependent Traveling Salesman Problem and its Application to the Tardiness Problem in One-Machine Scheduling. Opns. Res. (1978) 26:86–110LinkGoogle Scholar
  • Platz K., Brokof U., Winter H., Nüsser H.-G. Optimising Air Traffic Flow at Airports. Advanced Technologies for Air Traffic Flow Management (1994) (Springer-Verlag, Berlin) 153–190CrossrefGoogle Scholar
  • Psaraftis H. N. A Dynamic Programming Approach to the Aircraft Sequencing Problem. (1978) . Report R78-4, Flight Transportation Laboratory, MIT, Cambridge, MAGoogle Scholar
  • Psaraftis H. N. A Dynamic Programming Approach for Sequencing Groups of Identical Jobs. Opns. Res. (1980) 28:1347–1359LinkGoogle Scholar
  • Robinson J. E., Davis T. J., Isaacson D. R. Fuzzy Reasoning-Based Sequencing of Arrival Aircraft in the Terminal Area. AIAA Guidance, Navigation and Control Conference (1997) (New Orleans, LA). Available from http://www.ctas.arc.nasa.gov/publications/Google Scholar
  • Rubin P. A., Ragatz G. L. Scheduling in a Sequence Dependent Setup Environment with Genetic Search. Comput. Opns. Res. (1995) 22:85–99CrossrefGoogle Scholar
  • Simchi-Levi D., Berman O. Minimizing the Total Flow Time of n Jobs on a Network. IIE Trans. (1991) 23:236–244CrossrefGoogle Scholar
  • Simons R. Making Best Use of the World's Favourite Runways. OR Newsletter (1997) 19–21SeptemberGoogle Scholar
  • So K. T. Some Heuristics for Scheduling Jobs on Parallel Machines with Setups. Management Sci. (1990) 36:467–475LinkGoogle Scholar
  • Stewart J. A., Shortreed J. H. Risk and Capacity Impacts of ATC Separation Rules. J. Transp. Eng.—Am. Soc. Civil Eng. (1993) 119:705–722CrossrefGoogle Scholar
  • Tan K. C., Narasimhan R. Minimizing Tardiness on a Single Processor with Sequence-Dependent Setup Times: A Simulated Annealing Approach. Omega (1997) 25:619–634CrossrefGoogle Scholar
  • van der Veen J. A. A., Zhang S. Low-Complexity Algorithms for Sequencing Jobs with a Fixed Number of Job-Classes. Comput. Opns. Res. (1996) 23:1059–1067CrossrefGoogle Scholar
  • Venkatakrishnan C. S., Barnett A., Odoni A. R. Landings at Logan Airport: Describing and Increasing Airport Capacity. Transp.Sci. (1993) 27:211–227LinkGoogle Scholar
  • Völckers U., Winter H. Dynamic Planning and Time-Conflict Resolution in Air Traffic Management. Lecture Notes in Control and Information Sciences 80: Artificial Intelligence and Man-Machine Systems (1986) (Springer-Verlag, Berlin) 175–197CrossrefGoogle Scholar
  • Völckers U. A Rule-Based System for Arrival Sequencing and Scheduling in Air Traffic Control. Knowledge Based Concepts and Artificial Intelligence: Applications to Guidance and Control (1987) 9:1–9:12AGARD Lecture Series no. 155, NATOGoogle Scholar
  • Völckers U. Arrival Planning and Sequencing with COMPAS-OP at the Frankfurt ATC-center. Proceedings of the 1990 American Control Conference (1990) IEEE, Piscataway, NJ:496–501Google Scholar
  • White C. H., Wilson R. C. Sequence Dependent Set-Up Times and Job Sequencing. Int. J. Product. Res. (1977) 15:191–202CrossrefGoogle Scholar
  • Winter H., Nüsser H.-G.Advanced Technologies for Air Traffic Flow Management (1994) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.