A PTAS for semiconductor burn-in scheduling

作     者：Deng, XT Feng, HD Li, GJ Shi, BY 

作者机构：Shandong Univ Sch Math & Syst Sci Jinan 250100 Peoples R China Chinese Acad Sci Inst Software Beijing 100080 Peoples R China Shandong Univ Sch Comp Sci & Technol Jinan 250100 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China 

出 版 物：《JOURNAL OF COMBINATORIAL OPTIMIZATION》 (组合优化杂志)

年 卷 期：2005年第9卷第1期

页      面：1-13页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：RGC, (CityU 1081/02E) National Natural Science Foundation of China, NSFC, (10271065, 60373025) 

主　　题：approximation algorithm batch processing release date geometric rounding time stretching 

摘      要：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.