Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
RAIRO-Oper. Res., 51 4 (2017) 1177-1188
Published online: 24 November 2017
DOI: 10.1051/ro/2017044