A PTAS for semiconductor burn-in scheduling

被引：25
|
作者：
Deng, XT
Feng, HD
Li, GJ [1 ]
Shi, BY
机构：
[1] Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China
[2] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
[3] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China
[4] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2005年 / 9卷 / 01期
基金：
中国国家自然科学基金;
关键词：
approximation algorithm; batch processing; release date; geometric rounding; time stretching;
D O I：
10.1007/s10878-005-5480-7
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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.
引用
收藏
页码：1 / 13
页数：13
相关论文
共 50 条
  • [1] A PTAS for Semiconductor Burn-in Scheduling
    Xiaotie Deng
    Haodi Feng
    Guojun Li
    Benyun Shi
    [J]. Journal of Combinatorial Optimization, 2005, 9 : 5 - 17
  • [2] EFFICIENT ALGORITHMS FOR SCHEDULING SEMICONDUCTOR BURN-IN OPERATIONS
    LEE, CY
    UZSOY, R
    MARTINVEGA, LA
    [J]. OPERATIONS RESEARCH, 1992, 40 (04) : 764 - 775
  • [3] Scheduling semiconductor burn-in operations to minimize total flowtime
    Hochbaum, DS
    Landy, D
    [J]. OPERATIONS RESEARCH, 1997, 45 (06) : 874 - 885
  • [4] Dynamic scheduling problem of batch processing machine in semiconductor burn-in operations
    Chang, PC
    Chen, YS
    Wang, HM
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, VOL 4, PROCEEDINGS, 2005, 3483 : 172 - 181
  • [5] Scheduling Algorithms for Minimizing Tardiness of Orders at the Burn-in Workstation in a Semiconductor Manufacturing System
    Kim, Yeong-Dae
    Kang, Jae-Hun
    Lee, Gyeong-Eun
    Lim, Seung-Kil
    [J]. IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2011, 24 (01) : 14 - 26
  • [6] Efficient algorithms for scheduling semiconductor burn-in operations (vol 40, pg 764, 1992)
    Lee, CY
    Uzsoy, R
    MartinVega, LA
    [J]. OPERATIONS RESEARCH, 1997, 45 (01) : 153 - 154
  • [7] To Burn-In, or Not to Burn-In: That's the Question
    Suhir, Ephraim
    [J]. AEROSPACE, 2019, 6 (03)
  • [8] An advanced area scaling approach for semiconductor burn-in
    Kurz, Daniel
    Lewitschnig, Horst
    Pilz, Juergen
    [J]. MICROELECTRONICS RELIABILITY, 2015, 55 (01) : 129 - 137
  • [9] Burn-in, burn-in: DC inferno
    Breed, Paul
    [J]. EDN, 2009, 54 (25)
  • [10] Burn-in, burn-in: dc inferno
    Breed, Paul
    [J]. EDN, 2009, 54 (24) : 56 - 56
12345