Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Public Affairs, Public Policy and Public Administration

Engineering Management & Systems Engineering Theses & Dissertations

Aerial refueling problem

Articles 1 - 1 of 1

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan Apr 2011

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan

Engineering Management & Systems Engineering Theses & Dissertations

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the ...