A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.


https://doi.org/10.1142/S0129054102001473
@article{DBLP:journals/ijfcs/DengFLL02, author = {Xiaotie Deng and Haodi Feng and Guojun Li and Guizhen Liu}, title = {A {PTAS} for Minimizing Total Completion Time of Bounded Batch Scheduling}, journal = {Int. J. Found. Comput. Sci.}, volume = {13}, number = {6}, pages = {817--827}, year = {2002}, url = {https://doi.org/10.1142/S0129054102001473}, doi = {10.1142/S0129054102001473}, timestamp = {Fri, 27 Mar 2020 08:43:06 +0100}, biburl = {https://dblp.org/rec/journals/ijfcs/DengFLL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21