Scheduling two agents on a single machine : a parameterized analysis of NP-hard problems
Year of publication: |
2019
|
---|---|
Authors: | Hermelin, Danny ; Kubitza, Judith-Madeleine ; Shabtay, Dvir ; Talmon, Nimrod ; Woeginger, Gerhard J. |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 83.2018, p. 275-286
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | USA | United States | Theorie | Theory |
-
Complexity of the two-stage no-wait assembly problem with setup and removal times separated
Strusevič, Vitalij Aleksandrovič, (1991)
-
Computation of approximate α-points for large scale single machine scheduling problem
Gu, Han Yu, (2008)
-
A path-relinking approach for a bi-criteria disassembly sequencing problem
Adenso-Díaz, Belarmino, (2008)
- More ...
-
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Hermelin, Danny, (2019)
-
On the parameterized tractability of single machine scheduling with rejection
Hermelin, Danny, (2019)
-
A general scheme for solving a large set of scheduling problems with rejection in FPT time
Hermelin, Danny, (2022)
- More ...