{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:42Z","timestamp":1759848042534},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0020-0190(79)90143-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"60-63","source":"Crossref","is-referenced-by-count":32,"title":["Deadline scheduling of tasks with ready times and resource constraints"],"prefix":"10.1016","volume":"8","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90143-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(79)90143-1_BIB2","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":"B\u0142a\u017cewicz","year":"1977"},{"issue":"3","key":"10.1016\/0020-0190(79)90143-1_BIB3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(77)90015-1","article-title":"Simple algorithms for multiprocessor scheduling to meet deadlines","volume":"6","author":"B\u0142a\u017cewicz","year":"1977","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/0020-0190(79)90143-1_BIB4","first-page":"203","article-title":"Deadline scheduling of tasks \u2014 a survey","volume":"1","author":"B\u0142a\u017cewicz","year":"1977","journal-title":"Foundations of Control Engineering"},{"key":"10.1016\/0020-0190(79)90143-1_BIB5","series-title":"Scheduling with deadlines and resource constraints","author":"B\u0142a\u017cewicz","year":"1977"},{"key":"10.1016\/0020-0190(79)90143-1_BIB6","article-title":"Sequencing unit-time jobs with treelike precedence on m machines to minimize maximum lateness","author":"Brucker","year":"1976","journal-title":"Proc. IX Internat. Symposium on Mathematical Programming"},{"issue":"3","key":"10.1016\/0020-0190(79)90143-1_BIB7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Operations Res."},{"key":"10.1016\/0020-0190(79)90143-1_BIB8","year":"1976"},{"issue":"3","key":"10.1016\/0020-0190(79)90143-1_BIB9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(79)90143-1_BIB10","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","article-title":"Two-processor scheduling with start-times and deadlines","volume":"6","author":"Garey","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90143-1_BIB11","series-title":"Report BW 82\/77","article-title":"Optimization and approximation in deterministic sequencing and scheduling theory: a survey","author":"Graham","year":"1977"},{"key":"10.1016\/0020-0190(79)90143-1_BIB12","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(79)90143-1_BIB13","series-title":"Comp. Architecture and Networks","first-page":"285","article-title":"Some theorems on real time scheduling","author":"Labetoulle","year":"1974"},{"key":"10.1016\/0020-0190(79)90143-1_BIB14","unstructured":"J. Labetoulle, Real time scheduling in a multiprocessor environment. To appear."},{"issue":"No. 1","key":"10.1016\/0020-0190(79)90143-1_BIB15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1467-9574.1976.tb00264.x","article-title":"Minimizing maximum lateness on one machine: Computational experience and some applications","volume":"30","author":"Lageweg","year":"1976","journal-title":"Statistica Neerlandica"},{"issue":"1","key":"10.1016\/0020-0190(79)90143-1_BIB16","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:34Z","timestamp":1555072114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0020019079901431"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90143-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}