1 / 25

Air Traffic Control School Case Presentation – Dec. 2, 2010

Air Traffic Control School Case Presentation – Dec. 2, 2010. Stephen Damian, Frank Trudo, Andrew Zuroski. Air Traffic Control School. Training program for future air traffic controllers Must master scheduling processes to guarantee safe landing sequences for incoming flights

gaia
Download Presentation

Air Traffic Control School Case Presentation – Dec. 2, 2010

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Air Traffic Control School Case Presentation – Dec. 2, 2010 Stephen Damian, Frank Trudo, Andrew Zuroski

  2. Air Traffic Control School • Training program for future air traffic controllers • Must master scheduling processes to guarantee safe landing sequences for incoming flights • Review given data for 8 incoming flights and determine the most cost effective landing order without crashing any planes

  3. Problem Statement • Using feasible scheduling rules, determine which one is most cost effective • Determine mean flow time, average number of planes, and mean lateness for each sequence • Compare the trade-offs for each scheduling rule • Maintain safety as the primary objective

  4. Data for Incoming Flights

  5. Scheduling methods used in case MAIN OBJECTIVE: Land planes before flying time is finished causing a crash Shortest processing time (SPT)- job that has least processing time has highest priority Highest Cost per minute of flying time- order of sequence is dependent on the cost of a flight when it is flying (the highest cost has priority) Earliest Due Date (EDD)-job due earliest has top priority Critical Ratio (CR) -job with the smallest ratio of time remaining until due date to its processing time Slack Rule- flights landed in order of increasing slack time Could not use first come/first serve (FCFS), longest due date (LDD)or last come/first serve (LCFS) rules because planes would crash

  6. Scheduling Definitions • Lateness = completion time – due date (+ or -) • Slack = due date – processing time • Critical Ratio = time until due date/processing time • Makespan = length of time to complete batch (land all planes) • Flow time = time a job is complete –time job first available

  7. Stick to the Schedule!

  8. Earliest Due Date

  9. Earliest Due Date Process Time Total Flow Time 1.5 1.5 217 2.75 4.25 101 2.0 6.25 219 3.5 9.75 118 3.0 12.75 24 2.5 15.25 894 1.75 17 616 3.25 20.25

  10. Shortest Processing Time

  11. Shortest Processing Time (SPT) Process Time Total Flow Time 8076 1.5 1.5 894 1.75 3.25 101 2 5.25 24 2.5 7.75 217 2.75 10.5 219 3.5 14 118 3 17 616 3.25 20.25

  12. Analysis of SPT Method

  13. High Cost/Minute

  14. Highest Cost/Minute Process Time Total Flow Time 2.5 2.5 894 1.75 4.25 8076 1.5 5.75 217 2.75 8.5 101 2.0 10.5 219 3.5 14 118 3.0 17 616 3.25 20.25

  15. Analysis of Highest Cost/Minute Method

  16. CriticalRatio (Due Date/Processing Time)

  17. Slack Time (mins) = EDD

  18. Total Slack Cost

  19. Total Slack Cost – Alternatives

  20. Sequence for Slack Cost Process Time Total Flow Time 24 2.5 2.5 894 1.75 4.25 8076 1.5 5.75 101 2.0 7.75 217 2.75 10.5 219 3.5 14 118 3 17 616 3.25 20.25

  21. Conclusions • Earliest Due Date – minimizes lateness, no adjustments to avoid crashes • Shortest Processing Time – lowest mean flow time and average # of planes in process • Slack Cost – modified sequence is the most cost effective in this case

  22. Thank you and have a safe flight!

More Related