An approximation algorithm for scheduling aircraft with holding time

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2004, Pages 2760-2767

  Bayen, Alexandre M ^a   Tomlin, Claire J ^b,c   Ye, Yinyu ^b,d   Zhang, Jiawei ^d  

^a LRBA   (France)

^b Department of Aeronautics ^*  (United States)

^c STANFORD UNIVERSITY   (United States)

^d Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRAFFIC CONTROL; AIRCRAFT; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONTROL EQUIPMENT; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION ALGORITHM; HOLDING TIME; SCHEDULING PROBLEM; SINGLE QUEUE PROBLEM;

ALGORITHMS;

EID: 14244253369     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1428880     Document Type: Conference Paper

References (14)

1. R. K. AHUJA, T. L. MAGNANTI, and J. B. ORLIN. Network Flows, Theory, Algorithms and Applications. Prentice Hall, Upper Saddle River, NJ, 1993.
2. C. N. POTTS B. CHEN and G. J. WOEGINGER. A review of machine scheduling: Complexity, algorithms and approximability. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 3, pages 21-169. Kluwer Academic Publishers, Boston, MA, 1998.
3. P. BAPTISTE. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling, 2:245-252, 1999.
4. A. M. BAYEN, T. CALLANTINE, C. J. TOMLIN, Y. YE, and J. ZHANG. Optimal arrival traffic spacing via dynamic programming. Submitted to the 2004 AIAA Conference on Guidance, Navigation and Control, Jan. 2004.
5. A. M. BAYEN and C. J. TOMLIN. Real-time discrete control law synthesis for hybrid systems using MILP: applications to congested airspaces. In Proceedings of the American Control Conference, Denver, CO, June 2003.
6. nd IEEE Conference on Decision and Control, Maui, HI, Dec. 2003.
7. J. CARLIER. Problèmes d'ordonnancement à durées égales. QUESTIO, 5(4):219-229, 1981.
8. J. CHUZHOY, R. OSTROVSKY, and Y. RABANI. Approximation algorithms for the job interval selection problem and related scheduling problems. In IEEE Symposium on Foundations of Computer Science, pages 348-356, 2001.
9. G.B. DANTZIG and D.R. FULKERSON. Minimizing the number of tankers to meet a fixed schedule. Naval Res. Logist. Quart., 1:217-222, 1954.
10. T. ERLEBACH and F. SPIEKSMA. Simple algorithms for a weighted interval selection problem. In Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), LNCS 1969, pages 228-240. Springer-Verlag, 2000.
11. H. ERZBERGER, H. T. DAVIS, and S. M. GREEN. Design of Center-TRACON Automation System. In AGARD Meeting on Machine Intelligence in Air Traffic Management, Berlin, Germany, May 1993.
12. I. GERTSBAKH and H. I. STERN. Minimal resources for fixed and variable job schedules. Operations Research, 26:68-85, 1978.
13. N. NEOGI. Aircraft assignment for multiple runway configurations. Submitted to the 2004 AIAA Conference on Guidance, Navigation and Control, Jan. 2004.
14. nd IEEE Conference on Decision and Control, Maui, HI, Dec. 2003.