A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
| Year of publication: |
2019
|
|---|---|
| Authors: | Kellerer, Hans ; Rustogi, Kabir ; Strusevich, Vitaly A. |
| Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 90.2020, p. 1-5
|
| Subject: | Single machine scheduling | Earliness-Tardiness | Half-product problem | FPTAS | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
Hoffmann, Julius, (2024)
-
Single machine scheduling problem with unexpected failures under flexible maintenance
Yang, Mengyue, (2025)
-
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Gao, Yuan, (2016)
- More ...
-
Kellerer, Hans, (2013)
-
Kellerer, Hans, (2009)
-
The two-flight low risk helicopter transportation problem under the split pickup scenario
Kellerer, Hans, (2023)
- More ...