Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines

Imed Kacem, Myriam Sahnoune, Günter Schmidt 0002. Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO - Operations Research, 51(4):1177-1188, 2017. [doi]

Abstract

Abstract is missing.