//-->
A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Lee, Ju-Yong, (2015)
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Ozturk, Onur, (2017)
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
Wan, Long, (2015)
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Yuan, Jinjiang, (2017)