{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:19Z","timestamp":1759847539389,"version":"3.32.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5480-7","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"5-17","source":"Crossref","is-referenced-by-count":23,"title":["A PTAS for Semiconductor Burn-in Scheduling"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Haodi","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Benyun","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S.Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, ?Approximation schemes for minimizing average weighted completion time withrelease dates? in Proceedingof the40th Annual Symposium on Foundations of Computer Science, New York,1999, pp. 32?43.","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"CR2","unstructured":"K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, 1974."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"P. Brucker, A. Gladky, H. Hoogeveen, M. Kovalyov, C. Potts, T. Tautenhahn, and S. van de Velde, ?Scheduling a batching machine? Journal of Scheduling, vol. 1, pp. 31?54, 1998.","journal-title":"Journal of Scheduling"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C.Y. Lee, and R. Uzsoy, ?Minimizing total completion time on a batch processing machine with job families? O. R. Lett., vol. 13, pp. 61?65, 1993.","journal-title":"O. R. Lett."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M. Cai, X. Deng, H. Feng, G. Li, and G. Liu, ?A PTAS for minimizing total completion time of bounded batch scheduling? Lecture Notes in Computer Science 2337 (IPCO?2002), MIT, pp. 304?314, 2002.","DOI":"10.1007\/3-540-47867-1_22"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/B:JOCO.0000021939.01674.1f","volume":"8","author":"Bo Chen","year":"2004","unstructured":"Bo Chen, Xiaotie Deng, and Wenan Zang, ?Online schedulinga batch processing system to minimize total weighted job completion time?Journal of Combinatorial Optimization, vol. 8, pp. 85?95, 2004.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C. Lee, and R. Uzsoy, ?Minimizing total completion time on a batch processing machine with job families? Operations Research Letters, vol. 13, pp. 61?65, 1993.","journal-title":"Operations Research Letters"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00453-003-1053-2","volume":"38","author":"X.T. Deng","year":"2004","unstructured":"X.T. Deng, H.D. Feng, P.X. Zhang, Y.Z. Zhang, and H. Zhu, ?Minimizing mean completion time in a batch processing system? Algorithmica, vol. 38, pp. 513?528, 2004.","journal-title":"Algorithmica"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H. Rinnooy Kan, ?Optimization and approximation in deterministic sequencing and scheduling? Annals of Discrete Math, vol. 5, 1979.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"D.S. Hochbaum","year":"1997","unstructured":"D.S. Hochbaum and D. Landy, ?Scheduling semiconductor burn-in problem operations to minimize total flowtime? Operations Research, vol. 45, pp. 874?885, 1997.","journal-title":"Operations Research"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5480-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5480-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5480-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T10:44:15Z","timestamp":1734950655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5480-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5480"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5480-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}