Abstract
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. © 2005 Springer Science + Business Media, Inc.
| Original language | English |
|---|---|
| Pages (from-to) | 5-17 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Feb 2005 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
∗Research supported in part by an RGC CERG grant [CityU 1081/02E] and a grant from CityU [7001347]. †Supported by the fund from NSFC under grant numbers 10271065 and 60373025. ‡Corresponding author.
Research Keywords
- Approximation algorithm
- Batch processing
- Geometric rounding
- Release date
- Time stretching
Fingerprint
Dive into the research topics of 'A PTAS for semiconductor burn-in scheduling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver