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]
@article{KacemSS17,
title = {Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines},
author = {Imed Kacem and Myriam Sahnoune and Günter Schmidt 0002},
year = {2017},
doi = {10.1051/ro/2017044},
url = {https://doi.org/10.1051/ro/2017044},
researchr = {https://researchr.org/publication/KacemSS17},
cites = {0},
citedby = {0},
journal = {RAIRO - Operations Research},
volume = {51},
number = {4},
pages = {1177-1188},
}