A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
https://doi.org/10.1007/3-540-47867-1_22
@inproceedings{DBLP:conf/ipco/CaiDFLL02,
author = {Mao{-}cheng Cai and
Xiaotie Deng and
Haodi Feng and
Guojun Li and
Guizhen Liu},
editor = {William J. Cook and
Andreas S. Schulz},
title = {A {PTAS} for Minimizing Total Completion Time of Bounded Batch Scheduling},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {304--314},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_22},
doi = {10.1007/3-540-47867-1\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CaiDFLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签