On the parameterized tractability of single machine scheduling with rejection
Year of publication: |
16 February 2019
|
---|---|
Authors: | Hermelin, Danny ; Pinedo, Michael ; Shabtay, Dvir ; Talmon, Nimrod |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 273.2019, 1 (16.2.), p. 67-73
|
Subject: | Single machine scheduling | Scheduling with rejection | Parameterized complexity | Fixed-parameter tractability | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Xu, Hongyun, (2014)
-
Shabtay, Dvir, (2018)
-
Scheduling with returnable containers
Mensendiek, Arne, (2015)
- More ...
-
Scheduling two agents on a single machine : a parameterized analysis of NP-hard problems
Hermelin, Danny, (2019)
-
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Hermelin, Danny, (2019)
-
A general scheme for solving a large set of scheduling problems with rejection in FPT time
Hermelin, Danny, (2022)
- More ...