The following publications are possibly variants of this publication:
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteriaYunqiang Yin, Youhua Chen, Kaida Qin, Dujuan Wang. scheduling, 22(3):315-333, 2019. [doi]
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobsRubing Chen, Jinjiang Yuan, Yuan Gao. scheduling, 22(5):581-593, 2019. [doi]
- Minimizing Total Completion Time Subject to Job Release Dates and Preemption PenaltiesZhaohui Liu, T. C. Edwin Cheng. scheduling, 7(4):313-327, 2004. [doi]