{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:13:45Z","timestamp":1649042025361},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf02074875","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T21:58:03Z","timestamp":1123970283000},"page":"370-383","source":"Crossref","is-referenced-by-count":1,"title":["Fcfs-scheduling in a hard real-time environment under rush-hour conditions"],"prefix":"10.1007","volume":"32","author":[{"given":"J.","family":"Blieberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02074875_CR1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","volume":"16","author":"E. A. Bender","year":"1974","unstructured":"E. A. Bender,Asymptotic methods in enumeration, SIAM Review 16 (1974), 485\u2013515.","journal-title":"SIAM Review"},{"key":"BF02074875_CR2","doi-asserted-by":"crossref","unstructured":"J. Blieberger and U. Schmid,Preemptive LCFS scheduling in hard real-time applications, Performance Evaluation (1991) (to appear).","DOI":"10.1016\/0166-5316(92)90035-F"},{"key":"BF02074875_CR3","volume-title":"Asymptotic Methods in Analysis","author":"N. G. Bruijn de","year":"1981","unstructured":"N. G. de Bruijn,Asymptotic Methods in Analysis, Dover Publications, Inc., New York, 1981."},{"key":"BF02074875_CR4","unstructured":"M. Drmota and U. Schmid,Exponential limiting distributions in queueing systems with deadlines, (1991) SIAM J. Appl. Math. (to appear)."},{"key":"BF02074875_CR5","unstructured":"P. Flajolet,Analyse d'algorithmes de manipulation d'arbes et de fichiers, Th\u00e8se Paris-Sud-Orsay, 1979; Cahiers de BURO 34\u201335 (1981), 1\u2013209."},{"key":"BF02074875_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"P. Flajolet and A. Odlyzko,Singularity analysis of generating functions, SIAM J. Disc. Math. 3 (1990), 216\u2013240.","journal-title":"SIAM J. Disc. Math."},{"key":"BF02074875_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","volume":"9","author":"P. Flajolet","year":"1979","unstructured":"P. Flajolet, J. C. Raoult and J. Vuillemin,The number of registers required to evaluate arithmetic expressions, Theoret. Comput. Sci. 9 (1979), 99\u2013125.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02074875_CR8","doi-asserted-by":"crossref","unstructured":"P. Kirschenhofer and H. Prodinger,On the recursion depth of special tree traversal algorithms, Information and Computation 74, 15\u201332.","DOI":"10.1016\/0890-5401(87)90009-5"},{"key":"BF02074875_CR9","volume-title":"Queueing Systems, Vol. 1 and Vol. 2","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock,Queueing Systems, Vol. 1 and Vol. 2, John Wiley, New York, 1975."},{"key":"BF02074875_CR10","volume-title":"The Art of Computer Programing, Volume 1: Fundamental Algorithms","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programing, Volume 1: Fundamental Algorithms. 2nd ed., Addison-Wesley, Reading, Mass., 1973.","edition":"2nd ed."},{"key":"BF02074875_CR11","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching.","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Volume 3: Sorting and Searching., Addison-Wesley, Reading, Mass., 1973."},{"key":"BF02074875_CR12","doi-asserted-by":"crossref","unstructured":"U. Schmid and J. Blieberger,Some investigations on FCFS scheduling in hard real-time applications, Journal of Computer and System Sciences (1991) (to appear).","DOI":"10.1016\/0022-0000(92)90036-I"},{"key":"BF02074875_CR13","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and P. Flajolet,Average-Case Analysis of Algorithms and Data Structures, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.) (1990), North-Holland.","DOI":"10.1016\/B978-0-444-88071-0.50014-X"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02074875\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:23:51Z","timestamp":1586391831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02074875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF02074875"],"URL":"https:\/\/doi.org\/10.1007\/bf02074875","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}