A parameterized complexity view on non-preemptively scheduling interval-constrained jobs : few machines, small looseness, and small slack
Year of publication: |
June 2017
|
---|---|
Authors: | Van Bevern, René ; Niedermeier, Rolf ; Suchý, Ondřej |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 3, p. 255-265
|
Subject: | Release times and deadlines | Machine minimization | Sequencing within intervals | Shiftable intervals | Fixed-parameter tractability | NP-hard problem | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | KMU | SME | Produktionssteuerung | Production control | Algorithmus | Algorithm |
-
On the parameterized tractability of single machine scheduling with rejection
Hermelin, Danny, (2019)
-
Hosseinabadi, Ali Asghar Rahmani, (2015)
-
Serial batching to minimize the weighted number of tardy jobs
Hermelin, Danny, (2024)
- More ...
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Bentert, Matthias, (2022)
- More ...