Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
Year of publication: |
2021
|
---|---|
Authors: | Wan, Long ; Mei, Jiajie ; Du, Jiangze |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 290.2021, 1 (1.4.), p. 26-35
|
Subject: | Two-agent sceduling | Completion time | Tardy job | NP-completeness | FPTAS | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Terminplanung | Time scheduling | Produktionssteuerung | Production control |
-
Yang, Dar-li, (2014)
-
Compariming the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2013)
-
Allahverdi, Ali, (2014)
- More ...
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
-
Single machine total completion time scheduling problem with workload-dependent maintenance duration
Xu, Dehua, (2014)
-
Scheduling to minimize the maximum total completion time per machine
Wan, Long, (2015)
- More ...