Moderate exponential-time algorithms for scheduling problems
Year of publication: |
2022
|
---|---|
Authors: | T'kindt, Vincent ; Della Croce, Federico ; Liedloff, Mathieu |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 20.2022, 4, p. 533-566
|
Subject: | Complexity | Exact algorithms | Scheduling theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
-
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
Cheriyan, Joseph, (2021)
-
An exact algorithm for the Blocks Relocation Problem with new lower bounds
Quispe, Kent E. Yucra, (2018)
-
Tramp ship routing and scheduling with voyage separation requirements
Vilhelmsen, Charlotte, (2017)
- More ...
-
Exact exponential algorithms for 3-machine flowshop scheduling problems
Shang, Lei, (2018)
-
Exact solution of the two-machine flow shop problem with three operations
Della Croce, Federico, (2022)
-
A hybrid heuristic approach for single machine scheduling with release times
Della Croce, Federico, (2014)
- More ...