Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times

► We model the ARSP as a parallel machine scheduling with ready times and time window. ► We formulated a MIP model and develop two heuristics, MATC and SA to minimize TWT. ► Algorithms are tested in terms of solution quality and CPU time. ► MATC is more likely to outperform SA when the problem size...

Ausführliche Beschreibung