The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Year of publication: |
2019
|
---|---|
Authors: | Chen, Rubing ; Yuan, Jinjiang ; Gao, Yuan |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 5, p. 581-593
|
Subject: | Two-agent scheduling | Total completion time | Total number of tardy jobs | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Terminplanung | Time scheduling | Produktionssteuerung | Production control |
-
Minimizing total completion time on a single machine with step improving jobs
Kim, Eun-Seok, (2015)
-
Compariming the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2013)
-
Allahverdi, Ali, (2014)
- More ...
-
Chen, Rubing, (2023)
-
Singleāmachine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing, (2019)
-
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Chen, Rubing, (2019)
- More ...