Moderate exponential-time algorithms for scheduling problems

This survey investigates the field of moderate exponential-time algorithms for $${\mathcal{N}\mathcal{P}}$$ N P -hard scheduling problems, i.e., exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms. Scheduling problems are very challenging problems for which interesting results have emerged in the literature since 2010. We will provide a comprehensive overview of the known results of these problems before detailing three general techniques to derive moderate exponential-time algorithms. These techniques are Sort & Search, Inclusion–Exclusion and Branching. In the last part of this survey, we will focus on side topics such as approximation in moderate exponential time, the design of lower bounds on worst-case time complexities or fixed-parameter tractability. We will also discuss the potential benefits of moderate exponential-time algorithms for efficiently solving in practice scheduling problems.