A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling.
https://doi.org/10.1007/3-540-45678-3_3
@inproceedings{DBLP:conf/isaac/DengFZZ01,
author = {Xiaotie Deng and
Haodi Feng and
Pixing Zhang and
Hong Zhu},
editor = {Peter Eades and
Tadao Takaoka},
title = {A Polynomial Time Approximation Scheme for Minimizing Total Completion
Time of Unbounded Batch Scheduling},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {26--35},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_3},
doi = {10.1007/3-540-45678-3\_3},
timestamp = {Mon, 04 May 2020 13:17:48 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DengFZZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签