Parameterized complexity of machine scheduling : 15 open problems
| Year of publication: |
December 2018
|
|---|---|
| Authors: | Mnich, Matthias ; Van Bevern, René |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 100.2018, p. 254-261
|
| Subject: | Parallel machines | Shop scheduling | Makespan | Total completion time | Total tardiness | Throughput | Number of tardy jobs | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Produktionssteuerung | Production control | Theorie | Theory | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
-
Soares, Leonardo Cabral R., (2020)
-
Huo, Yumei, (2019)
- More ...
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
-
Afanasev, Vsevolod A., (2021)
-
Bentert, Matthias, (2022)
- More ...