The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on the multiple tankers (machines) to minimize the total weighted tardiness. ARSP assumes that the jobs have different release times and due dates. The ARSP is dynamic environment and unexpected events may occur. In this paper, rescheduling in the aerial refueling process with a time set of jobs will be studied to deal with job related disruptions such as the arrival of new jobs, the departure of an existing job, high deviations in the release times and changes in job priorities. In order to keep the stability and to avoid excessive computation, partial schedule repair algorithm is developed and its preliminary results are presented.
Aerial Refueling Process Rescheduling Under Job Related Disruptions
01.03.2011
Aufsatz (Konferenz)
Keine Angabe
Englisch
Robust Capacitated Train Rescheduling with Passenger Reassignment under Stochastic Disruptions
Transportation Research Record | 2021
|A Train Rescheduling Approach Under Disruptions in Urban Rail Transit Systems
Springer Verlag | 2025
|A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions
Online Contents | 2016
|Aerial Refueling Clearance Process Guide
NTIS | 2014
|