상세정보
Export to Refworks부가기능
Practical Approaches for Solving the Runway Scheduling Problem - The Departure Case
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Practical Approaches for Solving the Runway Scheduling Problem - The Departure Case. |
| 개인저자 | Baghdadi, Majed A. |
| 단체저자명 | North Carolina State University. Industrial and Systems Engineering. |
| 발행사항 | [S.l.]: North Carolina State University., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 112 p. |
| 기본자료 저록 | Dissertation Abstracts International 79-12B(E). Dissertation Abstract International |
| ISBN | 9780438282667 |
| 학위논문주기 | Thesis (Ph.D.)--North Carolina State University, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Advisers: Thom J. Hodgson |
| 요약 | The Runway Scheduling Problem (RSP) is common at large airports. With increased demand for flights over time, the capacity of runways may become insufficient when running in typical fashion: First-Come-First-Served (FCFS). There are issues that |
| 요약 | The goal of this dissertation is to provide efficient practical approaches to solve the RSP for departing aircraft in different operational conditions. There are many operational conditions that exist. The first condition is: 1 runway, 2 aircraf |
| 요약 | The second condition is: 1 runway, 3 types. Many airports deal with two types of aircraft most of the day. However, at certain times, they operate with three aircraft types. An approach to solve the problem for Cmax) or Fmax for small instances |
| 요약 | The third condition is: 2 runways, 2 types. When two runways are available, assignment of aircraft to runways is added to the sequencing problem. A proposed approach based on dividing the problem into two independent sub-problems is introduced, |
| 일반주제명 | Industrial engineering. Operations research. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
