Moderate exponential-time algorithms for scheduling problems

Vincent T’kindt (), Federico Della Croce () and Mathieu Liedloff ()
Additional contact information
Vincent T’kindt: University of Tours
Federico Della Croce: Politecnico di Torino
Mathieu Liedloff: University of Orléans

Annals of Operations Research, 2024, vol. 343, issue 2, No 7, 753-783

Abstract: Abstract 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.

Keywords: Scheduling theory; Exact algorithms; Complexity; 68R05; 68W01; 68W40; 90B35 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06289-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:343:y:2024:i:2:d:10.1007_s10479-024-06289-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06289-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().