Moderate exponential-time algorithms for scheduling problems

This survey investigates the field of moderate exponential-time algorithms for 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 interest...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:4OR Ročník 20; číslo 4; s. 533 - 566
Hlavní autori: T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2022
Springer Nature B.V
Springer Verlag
Predmet:
Algorithms
Business and Management
Computer Science
Graphs
Industrial and Production Engineering
Invited Survey
Lower bounds
Operations Research
Operations Research/Decision Theory
Optimization
Scheduling
68W40
68W01
68R05
90B35
Scheduling theory
Exact algorithms
Complexity
ISSN:1619-4500, 1614-2411
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This survey investigates the field of moderate exponential-time algorithms for 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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-022-00525-1