An improved lower bound for rank four scheduling
Year of publication: |
2014
|
---|---|
Authors: | Chen, Lin ; Ye, Deshi ; Zhang, Guochuan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 5, p. 348-350
|
Subject: | Complexity | APX-hardness | Scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research |
-
Prot, Damien, (2013)
-
Efficient approximation algorithms for scheduling moldable tasks
Wu, Xiaohu, (2023)
-
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, Krzysztof, (2023)
- More ...
-
Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
Chen, Lin, (2015)
-
Parallel machine scheduling with speed-up resources
Chen, Lin, (2018)
-
On-line scheduling of multi-core processor tasks with virtualization
Ye, Deshi, (2010)
- More ...