a ptas for semiconductor burn-in scheduling
文献类型：期刊论文
| 作者 | Deng XT ; Feng HD ; Li GJ ; Shi BY |
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 出版日期 | 2005 |
| 卷号 | 9期号:1页码:1-13 |
| 关键词 | approximation algorithm batch processing release date geometric rounding time stretching |
| ISSN号 | 1382-6905 |
| 学科主题 | Computer Science, Interdisciplinary Applications; Mathematics, Applied |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000227159000001 |
| 公开日期 | 2011-07-28 |
| 附注 | In this paper a polynomial time approximation scheme, PTAS for short, is presented for the problem of scheduling jobs in a batch processing system. Each job has a pre-defined release date, which indicates when the job is available, and a pre-defined burn-in time, which is the least time needed for processing the job. At one time, at most B jobs can be processed together, where B is a pre-given number. No preemption is permitted. |
| 源URL | [http://124.16.136.157/handle/311060/12526]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Deng XT,Feng HD,Li GJ,et al. a ptas for semiconductor burn-in scheduling[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2005,9(1):1-13. |
| APA | Deng XT,Feng HD,Li GJ,&Shi BY.(2005).a ptas for semiconductor burn-in scheduling.JOURNAL OF COMBINATORIAL OPTIMIZATION,9(1),1-13. |
| MLA | Deng XT,et al."a ptas for semiconductor burn-in scheduling".JOURNAL OF COMBINATORIAL OPTIMIZATION 9.1(2005):1-13. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。