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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Imed Kacem' in GoogleThis author has not been identified. Look up 'Myriam Sahnoune' in GoogleThis author has not been identified. Look up 'Günter Schmidt 0002' in Google

runs on WebDSL