{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:27:22Z","timestamp":1761323242390},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00362-1","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T14:00:25Z","timestamp":1058364025000},"page":"117-134","source":"Crossref","is-referenced-by-count":25,"title":["Minimal schedulability interval for real-time systems of periodic tasks with offsets"],"prefix":"10.1016","volume":"310","author":[{"given":"Annie","family":"Choquet-Geniet","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Grolleau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00362-1_BIB1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/nav.3800210112","article-title":"Sequencing with due-dates and early start times to minimize maximum tardiness","volume":"21","author":"Baker","year":"1974","journal-title":"Nav. Res. Logist. Quat."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01995675","article-title":"Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor","volume":"2","author":"Baruah","year":"1990","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0304-3975(03)00362-1_BIB3","series-title":"Modelling and Performance Evaluation of Computer Systems","first-page":"57","article-title":"Scheduling dependent tasks with different arrival times to meet deadlines","author":"Blazewicz","year":"1976"},{"issue":"1","key":"10.1016\/S0304-3975(03)00362-1_BIB4","article-title":"Scheduling with earliest start and due date constraints on multiple machines","volume":"22","author":"Bratley","year":"1975","journal-title":"Nav. Res. Logist. Quat."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB5","series-title":"Hard Real-Time Computing Systems","author":"Buttazzo","year":"1997"},{"key":"10.1016\/S0304-3975(03)00362-1_BIB6","doi-asserted-by":"crossref","unstructured":"F. Cottet, J.P. Babau, Off-line temporal analysis of hard real-time applications, in: Second IEEE Workshop on Real-Time Applications, 1994.","DOI":"10.1109\/RTA.1994.316137"},{"key":"10.1016\/S0304-3975(03)00362-1_BIB7","unstructured":"S. Eilenberg, Automata Languages and Machines, Vol. A, Academic Press, New York, 1976."},{"issue":"2","key":"10.1016\/S0304-3975(03)00362-1_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1007980022314","article-title":"The non-optimality of the monotonic priority assignment for hard real-time offsets free systems","volume":"13","author":"Goosens","year":"1997","journal-title":"J. Real Time Systems"},{"key":"10.1016\/S0304-3975(03)00362-1_BIB9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1015673516542","article-title":"Off line computation of real time schedules by means of petri nets","volume":"12","author":"Grolleau","year":"2002","journal-title":"J. Discrete Event Dyn. Systems"},{"issue":"3","key":"10.1016\/S0304-3975(03)00362-1_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","article-title":"A note on preemptive scheduling of periodic real-time tasks","volume":"11","author":"Leung","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","article-title":"On the complexity of fixed-priority scheduling of periodic real-time tasks","volume":"2","author":"Leung","year":"1982","journal-title":"Performance Evaluation"},{"issue":"1","key":"10.1016\/S0304-3975(03)00362-1_BIB12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00362-1_BIB13","unstructured":"A.K. Mok, Fundamental design problems for the hard real-time environments, Ph.D. Thesis, MIT, 1983."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB14","unstructured":"A.K. Mok, M.L. Dertouzos, Multi processor scheduling in a hard real-time environment, in: Proc. of Seventh Texas Conf. on Computer Systems, 1978."},{"issue":"10","key":"10.1016\/S0304-3975(03)00362-1_BIB15","first-page":"0","article-title":"Misconception about real-time computing","volume":"21","author":"Stankovic","year":"1988","journal-title":"IEEE Compu. Magaz."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB16","series-title":"Deadline Scheduling for Real-Time Systems","author":"Stankovic","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(03)00362-1_BIB17","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/32.48943","article-title":"Scheduling processes with release times, deadlines, precedence and exclusion relations","volume":"16","author":"Xu","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(03)00362-1_BIB18","doi-asserted-by":"crossref","unstructured":"J. Zamorano, A. Alonso, J.A. De La Puente, Automatic generation of cyclic schedules, in: WRTP\u201997\u201422nd IFAC\/IFIP Workshop on Real Time Programming, 1997, pp. 145\u2013151.","DOI":"10.1016\/S1474-6670(17)41401-7"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:58:57Z","timestamp":1552809537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503003621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503003621"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00362-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}