A historical note on the complexity of scheduling problems
Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
| Year of publication: |
2023
|
|---|---|
| Authors: | Lenstra, Jan K. ; Strusevič, Vitalij Aleksandrovič ; Vlach, Milan |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 1, p. 1-2
|
| Subject: | Computational complexity | NP-hardness | Partition | Scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.orl.2022.11.006 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014283273