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

Full description

Saved in:

Bibliographic Details
Published in:	4OR Vol. 20; no. 4; pp. 533 - 566
Main Authors:	T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2022 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!