{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:44Z","timestamp":1725559124161},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_29","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"318-329","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Job Scheduling Algorithms with Multi-type Contentions"],"prefix":"10.1007","author":[{"given":"Zhenming","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikas","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4757-3613-7_23","volume-title":"Applied Optimization: Computational Methods in Decision-Making, Economics and Finance","author":"K. Akcoglu","year":"2002","unstructured":"Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity cost algorithms for combinatorial auctions. In: Applied Optimization: Computational Methods in Decision-Making, Economics and Finance, pp. 455\u2013479. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1145\/335305.335410","volume-title":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 735\u2013744. ACM Press, New York (2000)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1145\/335305.335401","volume-title":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"P. Berman","year":"2000","unstructured":"Berman, P., DasGupta, B.: Improvements in throughout maximization for real-time scheduling. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 680\u2013687. ACM Press, New York (2000)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Simple approximation algorithm for nonoverlapping local alignments. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 677\u2013678 (2002)","DOI":"10.1007\/978-1-4613-0259-9_7"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. In: IEEE Symposium on Foundations of Computer Science, pp. 348\u2013356 (2001)","DOI":"10.1109\/SFCS.2001.959909"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jos.85","volume":"4","author":"B. DasGupta","year":"2001","unstructured":"DasGupta, B., Palis, M.A.: A Palis. Online real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling\u00a04(6), 297\u2013312 (2001)","journal-title":"Journal of Scheduling"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-40996-3_20","volume-title":"Algorithms and Computation","author":"T. Erlebach","year":"2000","unstructured":"Erlebach, T., Spieksma, F.C.R.: Simple algorithms for a weighted interval selection problem. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 228\u2013240. Springer, Heidelberg (2000)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: practical and theoretical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/509907.509929","volume-title":"Proceedings of the thiry-fourth annual ACM symposium on Theory of computing","author":"S. Kontogiannis","year":"2002","unstructured":"Kontogiannis, S.: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 124\u2013133. ACM Press, New York (2002)"},{"key":"29_CR10","first-page":"302","volume-title":"Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms","author":"R.J. Lipton","year":"1994","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 302\u2013311. ACM Press, New York (1994)"},{"key":"29_CR11","first-page":"69","volume":"8","author":"C. Qiao","year":"1999","unstructured":"Qiao, C., Yoo, M.: Optical burst switching(obs) - a new paradigm for an optical internet. Journal High Speed Networks\u00a08, 69\u201384 (1999)","journal-title":"Journal High Speed Networks"},{"key":"29_CR12","first-page":"3","volume":"8","author":"J. Turner","year":"1999","unstructured":"Turner, J.: Terabit burst switching. Journal High Speed Networks\u00a08, 3\u201316 (1999)","journal-title":"Journal High Speed Networks"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/49.887906","volume":"18","author":"Y. Xiong","year":"2000","unstructured":"Xiong, Y., Vandenhoute, M., Cankaya, H.C.: Control architecture in optical burst-switched wdm networks. IEEE Journal On Selected Areas in Communications\u00a018, 1838\u20131851 (2000)","journal-title":"IEEE Journal On Selected Areas in Communications"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Xu, J., Qiao, C., Li, J., Xu, G.: Efficient channel scheduling algorithms in optical burst switched networks. In: INFOCOM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco (March 2003)","DOI":"10.1109\/INFCOM.2003.1209247"},{"key":"29_CR15","first-page":"79","volume":"3230","author":"M. Yoo","year":"1997","unstructured":"Yoo, M., Qiao, C.: A high speed protocol for bursty traffic in optical networks. SPIE\u2019s All-Optical Communication Systems:Architecture, Control and Protocol Issues\u00a03230, 79\u201390 (1997)","journal-title":"SPIE\u2019s All-Optical Communication Systems:Architecture, Control and Protocol Issues"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:24Z","timestamp":1605759684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}