发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

F. Della Croce; V. T'kindt

作者F. Della Croce; V. T'kindt
卷第31卷
期第2期
印刷ISSN0167-6377
文件大小133.76KB
发表时间2003
DOI10.1016/s0167-6377(02)00215-8
页码142-148

← 返回【学霸图书馆】主页