A general scheme for solving a large set of scheduling problems with rejection in FPT time
Year of publication: |
2022
|
---|---|
Authors: | Hermelin, Danny ; Shabtay, Dvir ; Zelig, Chen ; Pinedo, Michael |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 25.2022, 2, p. 229-255
|
Subject: | N P-hard | Fixed parameter tractable | Flow-shop | Parallel machines | Scheduling with rejection | Single machine | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control | Algorithmus | Algorithm |
-
A review of four decades of time-dependent scheduling : main results, new topics, and open problems
Gawiejnowicz, Stanisław, (2020)
-
Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi, (2024)
-
Proportionate flow-shop scheduling with rejection
Shabtay, Dvir, (2016)
- More ...
-
On the parameterized tractability of single machine scheduling with rejection
Hermelin, Danny, (2019)
-
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)
- More ...