A historical note on the complexity of scheduling problems
Year of publication: |
2023
|
---|---|
Authors: | Lenstra, Jan K. ; Strusevich, Vitaly A. ; 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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
-
Ozturk, Onur, (2017)
-
Single-machine scheduling with times-based and job-dependent learning effect
Jiang, Zhongyi, (2017)
- More ...
-
Lenstra, Jan K., (1979)
-
Recent developments in deterministic sequencing and scheduling : a survey
Lawler, Eugene L., (1981)
-
Combinatorics in operations research
Kolen, Antoon W. J., (1990)
- More ...