{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T16:29:34Z","timestamp":1656606574923},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:00:00Z","timestamp":1154304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s11241-006-8198-4","type":"journal-article","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T22:10:22Z","timestamp":1154470222000},"page":"155-172","source":"Crossref","is-referenced-by-count":6,"title":["Approximation algorithms for scheduling real-time jobs with multiple feasible intervals"],"prefix":"10.1007","volume":"34","author":[{"given":"Jian-Jia","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Sheng","family":"Shih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"8198_CR1","doi-asserted-by":"crossref","unstructured":"Aydin H, Melhem R, Mosse D, Alvarez P (1999) Optimal reward-based scheduling for periodic real-time tasks. In: Proceedings of the 20th IEEE Real-Time Systems Symposium pp 79\u201389","DOI":"10.1109\/REAL.1999.818830"},{"key":"8198_CR2","doi-asserted-by":"crossref","unstructured":"Sprunt B, Sha L, Lehoczky J (1989) Aperiodic task scheduling for hard-real-time systems. Real-time Systems Journal pp 27\u201360","DOI":"10.21236\/ADA211344"},{"key":"8198_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste P (1999) An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters 24:175\u2013180","DOI":"10.1016\/S0167-6377(98)00045-5"},{"key":"8198_CR4","doi-asserted-by":"crossref","unstructured":"Han C-C, Lin K-J (1992) Scheduling distance-constrained real-time tasks. In: Proceedings of the 13th IEEE Real-Time Systems Symposium pp 300\u2013308","DOI":"10.1109\/REAL.1992.242649"},{"key":"8198_CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier J (1982) The one machine sequencing problem. European Journal of Operational Research 11:42\u201347","journal-title":"European Journal of Operational Research"},{"key":"8198_CR6","unstructured":"Cheong IK (1992) Scheduling Imprecise Hard Real-Time Jobs with Cumulative Error. PhD thesis, University of Illinois at Urbana-Champaign"},{"issue":"12","key":"8198_CR7","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1109\/12.477249","volume":"44","author":"M Hamdaoui","year":"1995","unstructured":"Hamdaoui M Ramanathan P (1995) A dynamic priority assignment technique for streams with (m, k)-RM deadlines. IEEE Transaction on Computers 44(12):1443\u20131451","journal-title":"IEEE Transaction on Computers"},{"key":"8198_CR8","doi-asserted-by":"crossref","unstructured":"Koren G, Shasha D (1995) Skip-over: Algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the 16th IEEE Real-Time Systems Symposium pp 110\u2013117","DOI":"10.1109\/REAL.1995.495201"},{"issue":"1","key":"8198_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"EL Lawler","year":"1990","unstructured":"Lawler EL (1990) A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research 26(1):125\u2013133","journal-title":"Operations Research"},{"issue":"1","key":"8198_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1):46\u201361","journal-title":"Journal of the ACM"},{"key":"8198_CR11","volume-title":"Real Time Systems","author":"JW-S Liu","year":"2000","unstructured":"Liu JW-S (2000) Real Time Systems. Prentice Hall, Englewood, Cliffs, NJ"},{"issue":"5","key":"8198_CR12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/2.76287","volume":"24","author":"JW-S Liu","year":"1991","unstructured":"Liu JW-S, Lin K-J, Shih WK, Yu AC-S, Chung J-Y, Zhao W (1991) Algorithms for scheduling imprecise computations. IEEE Computer 24(5):58\u201368","journal-title":"IEEE Computer"},{"key":"8198_CR13","doi-asserted-by":"crossref","unstructured":"Quan G, Hu, X (2000) Enhanced fixed-priority scheduling with (m, k)- firm guarantee. In: Proceedings of the 21th IEEE Real-Time Systems Symposium pp 79\u201388","DOI":"10.1109\/REAL.2000.895998"},{"key":"8198_CR14","unstructured":"Shih C-S, Liu JW-S, Cheong IK (2003) Scheduling jobs with multiple feasible intervals. In: Proceedings of the Real-Time and Embedded Computing Systems and Applications pp 53\u201371"},{"issue":"3","key":"8198_CR15","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/12.372040","volume":"44","author":"WK Shih","year":"1995","unstructured":"Shih WK, Liu JW-S (1995) Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error. IEEE Transaction on Computers 44(3):466\u2013471","journal-title":"IEEE Transaction on Computers"},{"issue":"3","key":"8198_CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0220035","volume":"20","author":"WK Shih","year":"1991","unstructured":"Shih WK, Liu JW-S, Chung JY (1991) Algorithms for scheduling imprecise computations with timing constraints. SIAM Journal on Computing 20(3):537\u2013552","journal-title":"SIAM Journal on Computing"},{"key":"8198_CR17","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-006-8198-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-006-8198-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-006-8198-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:04:27Z","timestamp":1559387067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-006-8198-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,31]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["8198"],"URL":"https:\/\/doi.org\/10.1007\/s11241-006-8198-4","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,31]]}}}